// binaris_fa_magassaga_2024_12_29.cpp : Defines the entry point for the console application.
//

//#include "stdafx.h"

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

using namespace std;



int main()
{
	
	int size,O;
	size = 0;
	O = 0;
	int mE,V;
	cin >> size >> O;
	int edges[100000];
	int nodes[100000];
	
	
	int x; // while segéd
	for (int i = 1; i < pow(2, size); i++)
	{
		nodes[i] = size-floor(log2(i))-1;
		edges[i] = 1;
	}
	edges[0] = 0;
	edges[1] = 0;
	for (int i = 0; i < O; i++)
	{
		cin >> mE >> V;
		edges[mE] = V;
		x = mE;
		while (x != 1)
		{
				
			if(x % 2 == 0)
			{
  			nodes[x/2] = max((edges[x] + nodes[x]), (edges[x+1]+nodes[x+1]));
  			//cout<<"x: "<< x << "  vizsgált edge pár: " << x <<" "<<x+1<<"  vizsgált node pár: "<<nodes[x]<<" "<<nodes[x+1] <<"  a(z) "<<(x/2)<< ". változtatott node értéke: "<<nodes[x/2]<<endl;
  			x = x/2;
			}
			else
			{
				nodes[x/2] = max((edges[x] + nodes[x]), (edges[x-1]+nodes[x-1]));
  			//cout<<"x: "<< x << "  vizsgált edge pár: " << x <<" "<<x+1<<"  vizsgált node pár: "<<nodes[x]<<" "<<nodes[x+1] <<"  a(z) "<<(x/2)<< ". változtatott node értéke: "<<nodes[x/2]<<endl;
  			x = x/2;
			}
		}
	cout<< nodes[1] <<endl;
	}
	
}