#include<bits/stdc++.h>
using namespace std;
int n,m;
const int N=1e6+10;
#define ui unsigned int
int ls[N],cn,rs[N],val[N],key[N];
ui s1[N],s2[N],v1[N],v2[N];
mt19937 rnd(time(0));
int newnode(int x,ui z){
    key[++cn]=rnd(),val[cn]=x;
    s1[cn]=v1[cn]=z,s2[cn]=v2[cn]=z*x;
    return cn;
}
void up(int x){
    s1[x]=s1[ls[x]]+s1[rs[x]]+v1[x];
    s2[x]=s2[ls[x]]+s2[rs[x]]+v2[x];
}
void split(int now,int &x,int &y,int v){
    if(!now){x=y=0;return;}
    if(val[now]<=v)x=now,split(rs[now],rs[x],y,v),up(x);
    else y=now,split(ls[now],x,ls[y],v),up(y);
}
int merge(int x,int y){
    if(!x||!y)return x+y;
    if(key[x]<key[y]){
        rs[x]=merge(rs[x],y),up(x);
        return x;
    }
    else{
        ls[y]=merge(x,ls[y]),up(y);
        return y;
    }
}
int rt;
ui Ask(int x){
    int a,b;split(rt,a,b,x);
    ui xp=s1[a]*(x+1)-s2[a];
    rt=merge(a,b);
    return xp;
}
void ad(int x,ui z){
    int a,b;split(rt,a,b,x);
    rt=merge(merge(a,newnode(x,z)),b);
}
int main(){
    int q,m;
    scanf("%d%d",&q,&m);m=(1<<m);
    ui x=0;
    for(int i=1,l,r;i<=q;i++){
        scanf("%d%d",&l,&r);
        (l+=x)%=m,(r+=x)%=m;if(l>r)swap(l,r);
        ad(l,i),ad(r+1,-i);
        x+=Ask(r),x-=Ask(l-1);
    }
    return printf("%d",(int)(x%(1<<30))),0;
}