// comp = compile
// compr = compile & run
// in terminal, gocp goes to cp directory

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

#include <bits/extc++.h>
using namespace __gnu_pbds;
using ll = long long;

using ordered_set = tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>;
using pl = pair<ll, ll>;
#define f first
#define s second

vector<int> cnt[2][22];
ll tc[2][22];

bool fl[2][1 << 20];

ll n, q;

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

    cin >> n >> q;

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j < 2; j++) {
            cnt[j][i] = vector<int>(1 << (n - i));
        }
    }

    for (ll i = 0; i <= n; i++) for (ll j = 0; j < 2; j++) tc[j][i] = (1 << (n - i));

    ll tot = 0;
    for (ll i = 0; i <= n; i++) tot += (1LL << (2 * i));

    for (int i = 0; i < q; i++) {
        int t, x;
        cin >> t >> x;
        --x;

        ll c = fl[t][x] ? -1 : 1;
        fl[t][x] ^= 1;

        for (int j = 0; j <= n; j++) {
            // cout << "J " << i << " " << j << " " << (x >> j) << endl;
            ll v = x >> j;
            if (cnt[t][j][v] == 0 || cnt[t][j][v] == (1 << j)) --tc[t][j];
            cnt[t][j][v] += c;
            if (cnt[t][j][v] == 0 || cnt[t][j][v] == (1 << j)) ++tc[t][j];

            // cout << "J " << i << " " << j << " " << (x >> j) << endl;
        }

        ll ans = 0;

        ll pa = 0, pb = 0;
        for (ll j = n; j > 0; j--) {
            pa = tc[0][j], pb = tc[1][j];
            ans += pa * pb * 4;
            // cout << j << " " << tc[0][j] << " " << tc[1][j] << '\n';
        }

        cout << tot - ans << '\n';
    }
}