#include <iostream>
#include <cmath>

using namespace std;
int check(int x, int dist[], int best[])
{
    while (x > 0)
    {
        best[x] = max(dist[2 * x] + best[x * 2], dist[2 * x + 1] + best[x * 2 + 1]);

        x = x / 2;
    }
    return best[1];
}
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int dist[65537]{ 1 };
    int best[65537];
    int n, m;
    cin >> n >> m;
    int i = 1;
    int x = n - 1;
    int a = 1;
    int z = pow(2, n);
    while (i < z)
    {
        if (i == pow(2, a))
        {
            x--;
            a++;
        }

        best[i] = x;
        i++;
    }
    for (int i = 0; i < pow(2, n); i++)
    {
        dist[i] = 1;
    }
    int b, c;
    for (int i = 0; i < m; i++)
    {
        cin >> b >> c;
        dist[b] = c;
        cout << check(b / 2, dist, best) << endl;
    }

    return 0;
}