#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m, hossz[65536], maxi[65536];
	cin >> n >> m;

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

	for(int i = 0; i < m; i++) {
		int cs, h;
		cin >> cs >> h;
		hossz[cs] = h;
		int apa = cs/2;
		while(apa >= 1) {
			maxi[apa] = max(hossz[2*apa]+maxi[2*apa], hossz[2*apa+1]+maxi[2*apa+1]);
			apa /= 2;
		}
		cout << maxi[1] << '\n';
	}

	return 0;
}