#include <iostream>
#include <vector>
#include <cmath>

using namespace std;


vector<vector<int>> keszito(vector<vector<int>> intervallumok, int current, int i, int j) {
    vector<int> intervallum(3);
    intervallum[0] = i;
    intervallum[1] = j;
    intervallum[2] = 1;
    intervallumok[current] = intervallum;
    if (i == j) {
        return intervallumok;
    }
    float kozep = (static_cast<float>(i) + static_cast<float>(j)) / 2;
    int also = floor(kozep);
    int felso = ceil(kozep);
    intervallumok = keszito(intervallumok, current*2, i, also);
    intervallumok = keszito(intervallumok, current*2+1, felso, j);
    return intervallumok;
}


int main()
{
    int N, M, sum = 0;
    cin >> N >> M;
    for (int i = 0; i<N; i++) {
        sum += pow(2, i);
    }
    //cout << sum << endl;
    int utolso_sor = pow(2, N-1);
    vector<int> magassagok(utolso_sor, N-1);
    vector<vector<int>> intervallumok(sum + 1);
    intervallumok = keszito(intervallumok, 1, 0, utolso_sor-1);
    //for (auto &r: vector<vector<int>>(intervallumok.begin()+1, intervallumok.end())) {
    //    cout << r[0] << " " << r[1] << endl;
    //}
    vector<vector<int>> parancsok;
    for (int i = 0; i < M; i++) {
        int a, b;
        cin >> a >> b;
        vector<int> parancs;
        parancs.push_back(a);
        parancs.push_back(b);
        parancsok.push_back(parancs);
    }
    //for (int i = 0; i < M; i++) {
    //    cout << parancsok[i][0] << " " << parancsok[i][1] << endl;
    //}
    for (auto &r : parancsok) {
        vector<int> intervallum = intervallumok[r[0]];
        for (int i = intervallum[0]; i <= intervallum[1]; i++) {
            magassagok[i] += r[1] - intervallum[2];
        }
        intervallumok[r[0]][2] = r[1];
        int maximum = 0;
        for (int i = 0; i < utolso_sor; i++) {
            //cout << magassagok[i] << " ";
            if (magassagok[i] > maximum) {maximum = magassagok[i];}
        }
        //cout << endl;
        cout << maximum << endl;
    }
    return 0;
}