1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#ifndef LOCAL
#pragma GCC optimize("Ofast", "unroll-all-loops")
#endif
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p); i<=(k); ++i)
#define REP(i,k) FOR(i,0,(k)-1)
#define RFOR(i,p,n) for(int i=(p); i>=(n); --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V <int> vi;
typedef V <ll> vll;
typedef C int ci;
typedef C ll cll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf=2.1e9;
cll infll=4.5e18;
int I(){
    int z;
    while ((z=getchar_unlocked())<'0'||z>'9');
    int r=z-'0';
    while ((z=getchar_unlocked())>='0'&&z<='9')
        r=r*10+z-'0';
    return r;
}
void ans(){
    ci n=I(),m=I(),z=I();
    ci cap=1e6;
    vi ai(n); generate(all(ai), I);
    if (1||ll(m+z)*n<=ll(2e10)){
        vll sumawi(cap);
#define SPL 16
        REP(_, m+z){
            ci t=I(),p=I(),l=I();
            if (t==1){
                int i=0;
                for (; i+SPL<=p; ){
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                    sumawi[i]+=l;
                    ++i;
                }
                for (; i<p; ++i)
                    sumawi[i]+=l;
            }
            else{
                //REP(i, p)
                long long w=0;
                int i=0;
                for (; i+SPL<=p; ){
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                    if (ai[i]>=l)
                        w+=sumawi[i];
                    ++i;
                }
                for (; i<p; ++i)
                    if (ai[i]>=l)
                        w+=sumawi[i];
                printf("%lld\n", w);
            }
        }
    }
}
int main(){
    //ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    //tt=I();
    while (tt--)ans();
}