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
//
#ifndef __SIZEOF_INT128__
  #define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string nm): name(nm) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    static T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
std::int32_t main()
{
    std::cout.tie(nullptr); //for luck
    std::cin.tie(nullptr); std::ios_base::sync_with_stdio(0);
    int n(in()), m(in()), z(in());
    vector <int> a(n);
    rep(i, 0, n)cin >> a[i];
    if(ll(z)*m <= int(1e7)){
        // jak duze, gdzie zapisac, z jakim wspolczynnikiem
        vector <vector <tuple <int, int, int>>> q(int(1e6)+1);
        vector <pair <int, int>> op;
        int l(0);
        rep(i, 0, m+z){
            if(in() == 1){
                int p(in()), w(in());
                op.pb(p, w);
            }
            else{
                int p(in()), d(in());
                for(auto [pp, w]: op)q[min(pp, p)-1].pb(d, l, w);
                ++l;
            }
        }
        vector <ll> odp(z);
        const int pol = 1<<20;
        vector <int> tre(pol*2+3);
        rep(i, 0, n){
            int A(pol-1), B(pol+a[i]+1);
            while(A+1 != B){
                if(A % 2 == 0)++tre[A+1];
                if(B % 2 == 1)++tre[B-1];
                A /= 2;
                B /= 2;
            }
            for(auto [g, r, w]: q[i]){
                int o(0);
                g += pol;
                while(g){
                    o += tre[g];
                    g /= 2;
                }
                odp[r] += ll(w)*o;
            }
        }
        for(auto i: odp)cout << i << '\n';
        return 0;
    }
    vector <ll> r(n);
    rep(i, 0, m+z){
        if(in() == 1){
            int p(in()), w(in());
            rep(i, 0, p)r[i] += w;
        }
        else{
            int p(in()), d(in());
            ll o(0);
            rep(i, 0, p)if(a[i] >= d)o += r[i];
            cout << o << '\n';
        }
    }
    return 0;
}