const int LEN = 375;

int n, p;
vector <vll> q;
vll a;
ll ANS;

pii find_pos(int pos)
{
    int bl = 0;
    for (auto x : q)
    {
        if (pos >= x.size())
            pos -= x.size(), ++bl;
        else
            return mk(bl, pos);
    }
}

void add_block_build(int pos)
{
    q.inb(a);
    if (pos)
    {
        ll x = q[pos - 1].back();
        q[pos - 1].pop_back();
        q[pos].inb(x);
    }
}

void add_block(int pos)
{
    vll sw;
    int sz = q[pos - 1].size();
    for (int i = sz - 1; i >= sz / 2; --i)
    {
        sw.inb(q[pos - 1].back());
        q[pos - 1].pop_back();
    }
    reverse(all(sw));
    q.insert(q.begin() + pos, sw);
}

void add_x(ll x)
{
    q.back().inb(x);
    ANS += x * x;
    if (q.back().size() == LEN)
        add_block_build(q.size());
}

void delete_block(int pos)
{
    q.erase(q.begin() + pos);
}

void delete_inc(pii npos)
{
    int bl = npos.X, pos = npos.Y;
    ll x = q[bl][pos];
    ll xl = x >> 1ll;
    ll xr = x - xl;
    ANS -= x * x;
    q[bl].erase(q[bl].begin() + pos);
    if (q[bl].empty())
    {
        delete_block(bl), pos = 0;
        if (bl == q.size())
            --bl, pos = q[bl].size() - 1;
    }
    if (!bl && !pos)
        ANS -= q[0][0] * q[0][0], q[0][0] += x, ANS += q[0][0] * q[0][0];
    else
    {
        int lind = pos - 1;
        int rind = pos;
        int rb = bl;
        int lb = bl;
        rind = min(rind, (int)q[rb].size() - 1);
        if (lind == -1)
        {
            --lb;
            lind = q[lb].size() - 1;
        }
        if (lind != rind)
        {
            ANS -= q[lb][lind] * q[lb][lind];
            ANS -= q[rb][rind] * q[rb][rind];
            q[lb][lind] += xl;
            q[rb][rind] += xr;
            ANS += q[lb][lind] * q[lb][lind];
            ANS += q[rb][rind] * q[rb][rind];
        }
        else
        {
            ANS -= q[lb][lind] * q[lb][lind];
            q[lb][lind] += x;
            ANS += q[lb][lind] * q[lb][lind];
        }
    }
}

void split_inc(pii npos)
{
    int bl = npos.X, pos = npos.Y;
    ll x = q[bl][pos];
    ANS -= x * x;
    ll xl = x >> 1ll;
    ll xr = x - xl;
    q[bl][pos] = xl;
    q[bl].insert(q[bl].begin() + pos + 1, xr);
    ANS += xl * xl + xr * xr;
    if (q[bl].size() == LEN)
        add_block(bl + 1);
}
int solve()
{
    add_block_build(0);
    scanf("%d %d", &n, &p);
    forn(i, n)
    {
        ll x;
        scanf("%lld", &x);
        add_x(x);
    }
    int Q;
    scanf("%d", &Q);
    printf("%lld\n", ANS);
    forn(i, Q)
    {
        int cmd, pos;
        scanf("%d %d", &cmd, &pos);
        --pos, --cmd;
        pii npos = find_pos(pos);
        if (!cmd)
            delete_inc(npos);
        else
            split_inc(npos);
        printf("%lld\n", ANS);
    }
    return 0;
}