#include <iostream>

using namespace std;

void setupBinTree(int binTree[], int edges[], int level, int N, int node)
{
    if(level >= N){
        return;
    }
    binTree[node] = N - level - 1;
    edges[node] = 1;
    setupBinTree(binTree, edges, level+1, N, 2*node);
    setupBinTree(binTree, edges, level+1, N, 2*node+1);
}

void update(int binTree[], int edges[], int node)
{
    if(node < 1){
        return;
    }
    binTree[node] = max(binTree[2*node] + edges[2*node], binTree[2*node+1] + edges[2*node+1]);
    update(binTree, edges, node/2);
}

int main()
{
    int binTree[100000] = {}, edges[100000] = {};
    int N, M, val, tempNode;
    cin >> N >> M;
    setupBinTree(binTree, edges, 0, N, 1);

    for(int i = 0; i < M; i++){
        cin >> tempNode >> val;
        edges[tempNode] = val;
        if(tempNode%2 == 0){
            update(binTree, edges, tempNode/2);
        }
        else{
            update(binTree, edges, tempNode/2);
        }
        cout << binTree[1] << endl;
    }
    return 0;
}