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

using namespace std;

long int nagy(long int m,long int t[])
{
    long int legnagyobb = 0;
    for(long int i = 0; i< m; i++){
        if(t[i] > legnagyobb){
            legnagyobb = t[i];
        }
        //cout << t[i] << " " ;
    }
    //cout << endl;
    return legnagyobb;
}
int main()
{
    int n = 0;
    int m = 0;
    cin >> n;
    cin >> m;
    int a;
    int b;
    long int legnagyobb = 0;

    int *fa= new int[(long int)pow(2,n)-1];

    for(long int i=0; i < (long int)pow(2,n)-1; i++){
        fa[i] = 1;
    }

    long int *level=new long int[(int)pow(2,(n-1))];


    for(long int i=0; i < pow(2,(n-1)); i++){
        level[i] = n-1;
    }

    for(int i=0; i < m; i++){
        cin >> a;
        cin >> b;

        //cout << b << " " << fa[a-1] << " ";
        int valt = b - fa[a-1];

        fa[a-1] = b;
        int elso=a;
        int db=1;
        while (elso*2<(long int)pow(2,n)-1){
            elso*=2;
            db*=2;
        }
        //cout<<elso<<" " <<db << " " << valt << " " <<  elso-(int)pow(2,(n-1)) <<endl;
        for(long int j=0; j < db; j++){
            level[elso-(long int)pow(2,(n-1))+j] += valt;
        }
        cout << nagy((long int) pow(2,(n-1)),level) << "\n";
    }


    return 0;
}