import sys
input = sys.stdin.readline

N,Q=map(int,input().split())

# 非再帰遅延伝搬セグ木

seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
seg_height=1+N.bit_length() # Segment treeの高さ
SEG=[0]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
LAZY=[0]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化

def indexes(L,R): # 遅延伝搬すべきノードのリストを返す. （つまり, updateやgetvaluesで見るノードより上にあるノードたち）
    INDLIST=[]

    R-=1
    
    L>>=1
    R>>=1

    while L!=R:
        if L>R:
            INDLIST.append(L)
            L>>=1
        else:
            INDLIST.append(R)
            R>>=1

    while L!=0:
        INDLIST.append(L)
        L>>=1

    return INDLIST

def updates(l,r):
        
    L=l+seg_el
    R=r+seg_el

    L//=(L & (-L))
    R//=(R & (-R))

    UPIND=indexes(L,R)
    
    for ind in UPIND[::-1]: # 遅延伝搬
        if LAZY[ind]==1:
            LAZY[ind<<1]^=1
            LAZY[1+(ind<<1)]^=1
            SEG[ind<<1]=(1<<(seg_height - ((ind<<1).bit_length()))) - SEG[ind<<1]
            SEG[1+(ind<<1)]=(1<<(seg_height - ((1+(ind<<1)).bit_length()))) - SEG[1+(ind<<1)]
            LAZY[ind]=0

    while L!=R:
        if L > R:
            SEG[L]=(1<<(seg_height - (L.bit_length()))) - SEG[L]
            LAZY[L]^=1
            L+=1
            L//=(L & (-L))

        else:
            R-=1
            SEG[R]=(1<<(seg_height - (R.bit_length()))) - SEG[R]
            LAZY[R]^=1
            R//=(R & (-R))

    for ind in UPIND:
        SEG[ind]=SEG[ind<<1]+SEG[1+(ind<<1)]

def getvalues(l,r): # 区間[l,r)に関する和を調べる

    L=l+seg_el
    R=r+seg_el

    L//=(L & (-L))
    R//=(R & (-R))

    UPIND=indexes(L,R)
    
    for ind in UPIND[::-1]: # 遅延伝搬
        if LAZY[ind]==1:
            LAZY[ind<<1]^=1
            LAZY[1+(ind<<1)]^=1
            SEG[ind<<1]=(1<<(seg_height - ((ind<<1).bit_length()))) - SEG[ind<<1]
            SEG[1+(ind<<1)]=(1<<(seg_height - ((1+(ind<<1)).bit_length()))) - SEG[1+(ind<<1)]
            LAZY[ind]=0
            
    ANS=0

    while L!=R:
        if L > R:
            ANS+=SEG[L]
            L+=1
            L//=(L & (-L))

        else:
            R-=1
            ANS+=SEG[R]
            R//=(R & (-R))

    return ANS

for queries in range(Q):
    l,r=map(int,input().split())
    updates(l,r+1)

    #print(SEG)
    #print(LAZY)

    print(getvalues(1,N+1))