PROGRAMMING:Sacrifice in the life of Xilu
In his life, $$Manaka $$often goes to the shrine to offer sacrifices to the God of the sea. The God of the sea has an array, $$a $, and he gives two integers, $$X, y $$every day.
When $$Manaka $$comes to sacrifice, it means that the God of the sea wants $$Manaka $$to calculate all $$a of $$I $$module $$x $$equal to $$y $$_ The sum of I $$($$I $$denotes an array subscript).
When no one came to sacrifice at that time, the $$a in the Poseidon's array_ X $$plus $$y $$($$x $$denotes a subscript).
###Input format:
In the first line, two integers, $$n, M $$, $$n $$denote the length of the array, $$a_ 1-a_ N $$, $$M $$means there are $$M $$days.
The next line of $$n $$numbers represents the array owned by Lord Poseidon.
Next, $$M $$line, each line has three integers, $$OP, x, y $$, $$OP $$has only two cases of $$1 and $$2 $, which respectively means that $$Manaka $$does not come to sacrifice or to sacrifice.
When $$OP $$is 1, add $$y $$to position $$x $$of array $$a $.
When $$OP $$is 2, query all $$a whose subscript module $$x $$is equal to $$y $_ Sum of I $$
$$tips$$: $$1<=n,m<=100000$$, $$1<=a_ i<=1000000000$$, $$1<=x<=n$$, $$1<=y<=1000000000$$
###Output format:
When $$OP $$is 2, an integer is output to represent all $$a whose subscript module $$x $$is equal to $$y $_ The sum of I $$.
###Input example:
Here is a set of inputs. For example:
```in
3 1
1 2 3
2 3 1
```
###Output example:
The corresponding output is given here. For example:
```out
one
```
answer：If there is no answer, please comment
When $$Manaka $$comes to sacrifice, it means that the God of the sea wants $$Manaka $$to calculate all $$a of $$I $$module $$x $$equal to $$y $$_ The sum of I $$($$I $$denotes an array subscript).
When no one came to sacrifice at that time, the $$a in the Poseidon's array_ X $$plus $$y $$($$x $$denotes a subscript).
###Input format:
In the first line, two integers, $$n, M $$, $$n $$denote the length of the array, $$a_ 1-a_ N $$, $$M $$means there are $$M $$days.
The next line of $$n $$numbers represents the array owned by Lord Poseidon.
Next, $$M $$line, each line has three integers, $$OP, x, y $$, $$OP $$has only two cases of $$1 and $$2 $, which respectively means that $$Manaka $$does not come to sacrifice or to sacrifice.
When $$OP $$is 1, add $$y $$to position $$x $$of array $$a $.
When $$OP $$is 2, query all $$a whose subscript module $$x $$is equal to $$y $_ Sum of I $$
$$tips$$: $$1<=n,m<=100000$$, $$1<=a_ i<=1000000000$$, $$1<=x<=n$$, $$1<=y<=1000000000$$
###Output format:
When $$OP $$is 2, an integer is output to represent all $$a whose subscript module $$x $$is equal to $$y $_ The sum of I $$.
###Input example:
Here is a set of inputs. For example:
```in
3 1
1 2 3
2 3 1
```
###Output example:
The corresponding output is given here. For example:
```out
one
```
answer：If there is no answer, please comment