#include <iostream>
using namespace std;

long powerOf2(int exponent) {
    long out = 1;
    out <<= exponent;
    return out;
}

class Node {
    public:
        int distanceUp;
        long endNodesStart;
        long endNodesEnd;
        long depth;

        void init(long ID, int treeDepth) {
            int layer = 1;
            int tmp = ID;
            while (tmp >= 2) {
                tmp >>= 1;
                layer++;
            }
            distanceUp = 1;
            long layerDif = powerOf2(treeDepth-layer);
            endNodesStart = ID*layerDif;
            endNodesEnd = ID*layerDif + layerDif-1;
        }
};

/**
 * adds the change to end nodes from start to end (inclusive)
*/
void updateDepth(int change, Node* array, int start, int end) {
    for (int i = start; i <= end; i++) {
        array[i].depth += change;
    }
}

int max(Node* array, long start, long end) {
    int max = 0;
    int ID;
    for (long i = start; i <= end; i++) {
        //that extra condition is ugly af but it works
        if (array[i].depth > max && i != 65535) {
            max = array[i].depth;
            ID = i;
        }
    }
    return max;
}

int main() {
    int treeDepth, M;
    cin >> treeDepth;
    cin >> M;
    int longestBranch = 0;
    long arrayLength = powerOf2(treeDepth)-1;
    long endNodesStart = powerOf2(treeDepth-1);
    //cerr << "before array\n";
    Node allNodes[arrayLength];
    //cerr << "after array\n";
    //create Nodes
    for (long i = 0; i < arrayLength; i++) {
        allNodes[i].init(i+1, treeDepth);
    }
    //cerr << "created nodes\n";
    //set default length for end Nodes
    for (long i = endNodesStart; i < arrayLength; i++) {
        allNodes[i].depth = treeDepth-1;
    }
    //cerr << "set default lengths\n";
    //read instructions from stdin
    for (int i = 0; i < M; i++) {
        if (i == 12) {
            cerr << "watch out\n";
        }
        int newDistance, nodeID;
        cin >> nodeID;
        nodeID--;
        cin >> newDistance;
        Node &modifiedNode = allNodes[nodeID];
        int change = newDistance-modifiedNode.distanceUp; 
        modifiedNode.distanceUp = newDistance;
        if (change != 0) updateDepth(change, allNodes, modifiedNode.endNodesStart, modifiedNode.endNodesEnd);
        if (change > 0) {
            long currentHeight = max(allNodes, modifiedNode.endNodesStart, modifiedNode.endNodesEnd);
            if (currentHeight > longestBranch) longestBranch = currentHeight;
        }
        else if (change < 0) {
            longestBranch = max(allNodes, endNodesStart, arrayLength-1);
        }
        cout << longestBranch << "\n";
        //cerr << i << "/" << M << "\r";
    }
}

/**
 * Node array[] as function parameter not an array??
*/