#include <iostream>
#include <vector>
#include <map>

using namespace std;

map<int, int> etp;
//vector<int> etp;
int ls = 1;
int N, M;

int height(int vertex){
    int s;
    if(etp.count(vertex)) s = etp.at(vertex);
    else s = 1;
    if(vertex == 1) s = 0;
    if(vertex >= ls) return s;

    int e1 = height(vertex*2);
    int e2 = height(vertex*2+1);

    return s + max(e1, e2);
}

int main()
{
    cin >> N >> M;

    for(int i=1; i<N; i++) ls*= 2;

    int V, E;
    for(int _=0; _<M; _++){
        cin >> V >> E;
        etp[V] = E;
        cout << height(1) << endl;
    }

    //cout << height(1) << endl;

    return 0;
}