snippet.cpp

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using lll = __int128;
using ull = unsigned long long;
using uint = unsigned int;
using ushort = unsigned short;
template<typename T> using vec2D = vector<vector<T>>;
template<typename T, typename U> using pr = pair<T, U>;
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T, vector<T>, less<T>>;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fromv(v, n) v.begin() + n, v.end()
#define tov(v, n) v.begin(), v.begin() + n
#define atv(v, n) v.begin() + n
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define len(x) (int)(x).length()
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define feach(var, container) for (auto &var : container)
#define debug(x) cerr << #x << " = " << (x) << endl;

const int INF = 1e9;
const ll INF2 = 1e18;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = 1e-9;

typedef struct Fenwick {
    vector<ll> bit;
    int n;

    Fenwick(int n) {
        this->n = n;
        bit.assign(n, 0);
    }

    void add(int i, ll val, int mod = MOD) {
        for (; i < n; i += i & -i) {
            bit[i] += val;
            if (bit[i] >= MOD) bit[i] -= MOD;
            if (bit[i] < 0) bit[i] += MOD;
        }
    }

    ll sum(int i) const {
        ll r = 0;
        for (; i > 0; i -= i & -i) {
            r += bit[i];
            if (r >= MOD) r -= MOD;
        }
        return r;
    }

    ll sum(int l, int r, ll mod = MOD) {
        return ((sum(r) - sum(l - 1)) % mod + mod) % mod;
    }
};

void solve() {
    auto modpow = [](ll base, ll exp, ll mod = MOD) {
        ll result = 1;
        base %= mod;
        while (exp > 0) {
            if (exp & 1) result = (result * base) % mod;
            base = (base * base) % mod;
            exp >>= 1;
        }
        return result;
        };

    int q; cin >> q;

    const ll MAX = 100000;
    Fenwick fw(MAX);

    ll inv = (MOD + 1) / 2;
    vector<ll> invp(MAX + 1, 1);
    for (int i = 1; i <= MAX; i++) {
        invp[i] = invp[i - 1] * inv % MOD;
    }

    while (q--) {
        int c; cin >> c;
        if (c == 1) {
            ll x; cin >> x;
            ll idx = min(x, MAX);
            ll pref = fw.sum(idx);
            ll ans = modpow(2, x) * pref % MOD;
            cout << ans << endl;
        } else {
            int x; cin >> x;
            ll b = 0;
            for (int i = 0; i < x; i++) {
                ll x; cin >> x;
                b += x % MOD;
                if (b >= MOD) b -= MOD;
            }

            fw.add(x, b * invp[x] % MOD);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin>>t;

    while (t--) solve();

    return 0;
}