1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstdio>
 4 #include <cmath>
 5 #include <cstring>
 6 #include <queue>
 7 #include <stack>
 8 #include <map>
 9 #include <set>
10 #include <vector>
11 #include <cstdlib>
12 #include <string>
13 #include <bitset>
14
15 #define PI acos((double)-1)
16 #define E exp(double(1))
17 #define K 1000000
18 using namespace std;
19
20 struct node
21 {
22     int left,right;
23     long long cnt,x;
24
25 };
26 struct node tree[4*K+9];
27 int a[K+9];
28 void build(int id,int l,int r)
29 {
30     tree[id].left=l;tree[id].right=r;
31     if(l==r)
32     {
33         tree[id].x=tree[id].cnt=0;
34     }
35     else
36     {
37         build(2*id,l,(l+r)/2);
38         build(2*id+1,(l+r)/2+1,r);
39     }
40 }
41 void update(int id,int l,int r,int v)
42 {
43     if(tree[id].left ==l &&  tree[id].right==r)
44     {
45         tree[id].x+=v;tree[id].cnt++;
46     }
47     else
48     {
49         int mid=(tree[id].left+tree[id].right)/2;
50         if (r<=mid) update(id*2,l,r,v);
51         else if(l>mid)  update(id*2+1,l,r,v);
52         else update(id*2,l,mid,v),update(id*2+1,mid+1,r,v-(mid+1-l));
53     }
54 }
55
56 long long query(int id,int x)
57 {
58     if(tree[id].left==tree[id].right)
59         return tree[id].x;
60     long long sum=0;
61     sum+=tree[id].x-(x-tree[id].left)*tree[id].cnt;
62     int mid=(tree[id].left+tree[id].right)/2;
63     if (x<=mid)  return sum+query(id*2,x);
64     else  return sum+query(id*2+1,x);
65 }
66
67 int main(void)
68 {
69     int n,m;
70     cin>>n>>m;
71     for(int i=1;i<=n;i++)
72         scanf("%d",&a[i]);
73     build(1,1,n);
74     while(m--)
75     {
76         int op;
77         scanf("%d",&op);
78         if(op==1)
79         {
80             long long x,v,y;
81             scanf("%lld%lld",&x,&v);
82             y=v+x-1;
83             if(y>n)y=n;
84             update(1,x,y,v);
85         }
86         else
87         {
88             int x;
89             scanf("%d",&x);
90             printf("%d\n",(a[x]+query(1,x))%(772002 + 233));
91         }
92     }
93 }