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

using namespace std;

int main()
{
    int n = 0;
    int m = 0;
    cin >> n;
    cin >> m;
    long int a;
    long int b;

    unsigned long int fameret=((long int)1 << n) - 1;
    int *fa= new int[fameret];
    for(unsigned long int i=0; i < fameret; i++){
        fa[i] = 1;
    }

    unsigned long int levelmeret=(long int)1 << (n-1);
    //unsigned long int *level=new unsigned long int[levelmeret];
    //for(unsigned long int i=0; i < levelmeret; i++){
    //    level[i] = n-1;
    //}

    for(unsigned long int k=0; k < m; k++){
        cin >> a;
        cin >> b;

        int valt = b - fa[a-1];
        fa[a-1] = b;
        
	unsigned long int elso=a;
        unsigned long int db=1;
        while (elso*2<fameret){
            elso*=2;
            db*=2;
        }
        
	//for(unsigned long int j=0; j < db; j++){
        //    level[elso-levelmeret+j] += valt;
        //}
        
	unsigned long int legnagyobb = 0;

        for(unsigned long int i = 0; i < levelmeret; i++){
	    unsigned long int level = levelmeret+i;
	    unsigned long int osszeg = 0;
	    while (level>0) {
		osszeg+=fa[level];
		level >>=1;
	    }
		
            if(osszeg > legnagyobb){
                legnagyobb = osszeg;
            }
        }

        cout << legnagyobb << "\n";

    }

    return 0;
}