from sys import stdin,stdout

def main():
    N,M = [int(i) for i in stdin.readline().split()]
    k = [2**i for i in range(N+1)]
    f = [0,0]+[1]*k[N]
    h = [0]*k[N-1] + [N-1]*k[N-1]
    u = k[N-1]
##    print(f)

    def holvan(x):
        s = 1
        while x >= k[s]:
            s += 1
        return s

    maxi = N-1
    for i in range(M):
        a,uj = [int(i) for i in stdin.readline().split()]
        b = uj-f[a]
        f[a] = uj
        sor = holvan(a)
        le = N-sor
        maxiuj = N-1
        for i in range(a*k[le],a*k[le]+k[le]):
            h[i] += b
            if h[i] > maxiuj:
                maxiuj = h[i]
        if maxiuj > maxi:
            maxi = maxiuj
        else:
            maxi = max(h[u:])
        stdout.write(str(maxi)+'\n')
main()