#include <cstdio>
#include <cstring>
#include <algorithm>
char xB[(1<<15)+10],*xS=xB,*xT=xB;
#define gtc (xS==xT&&(xT=(xS=xB)+fread(xB,1,1<<15,stdin),xS==xT)?0:*xS++)
inline void read(int &x){register char ch=gtc;for(x=0;ch<'0'||ch>'9';ch=gtc);for(;ch>='0'&&ch<='9';x=(x<<1)+(x<<3)+ch-'0',ch=gtc);
}
const int N=1000010;
const int Inf=0x3f3f3f3f;
const int P=1000000007;
int n,k,p,f[N],g[N];
bool NO[N][7],die[N],vf[N],vg[N];
#define no(a,b) (NO[a][(b)+3])
#define ok(a,b) (!no(a,(b)-(a)))
inline int work(){int i,x,y,ans=0;for(i=1;i<=k;++i){read(x),read(y);if(std::abs(x-y)<=3)no(x,y-x)=true;}for(i=1;i<=n;++i)if(i&1)f[(i+1)>>1]=i;else f[n-(i>>1)+1]=i;f[0]=f[n],f[n+1]=f[1];++ans;for(i=1;i<=n;++i)if(no(f[i],f[i+1]-f[i])){--ans;break;}++ans;for(i=1;i<=n;++i)if(no(f[i],f[i-1]-f[i])){--ans;break;}printf("%d\n",ans);return 0;
}
inline int dfs(int pos,int last,int k,int t,int len){if(pos==len)return std::abs(t-last)<=3&&ok(last,t);int i,ret=0;for(i=std::max(last-3,k+1);i<=last+3&&i<n;++i)if((!die[i])&&ok(last,i)){die[i]=true;ret+=dfs(pos+1,i,k,t,len);die[i]=false;}return ret;
}
inline int D(int s,int k,int t){die[s]=die[t]=true;int ret=dfs(2,s,k,t,n-k);die[s]=die[t]=false;return ret;
}
inline int F(int x);
inline int G(int x);
inline int F(int x){if(vf[x])return f[x];vf[x]=true;if(n-x<=7)return f[x]=D(x,x,x+1);int ret=0;if(ok(0+x,2+x))ret=(ret+G(1+x))%P;if(ok(0+x,3+x)&&ok(2+x,1+x))ret=(ret+G(2+x))%P;if(ok(0+x,3+x)&&ok(3+x,2+x)&&ok(2+x,5+x)&&ok(4+x,1+x))ret=(ret+G(4+x))%P;if(ok(0+x,3+x)&&ok(3+x,6+x)&&ok(5+x,2+x)&&ok(2+x,4+x)&&ok(4+x,1+x))ret=(ret+G(5+x))%P;return f[x]=ret;
}
inline int G(int x){if(vg[x])return g[x];vg[x]=true;if(n-x<=7)return g[x]=D(x+1,x,x);int ret=0;if(ok(2+x,0+x))ret=(ret+F(1+x))%P;if(ok(1+x,2+x)&&ok(3+x,0+x))ret=(ret+F(2+x))%P;if(ok(1+x,4+x)&&ok(5+x,2+x)&&ok(2+x,3+x)&&ok(3+x,0+x))ret=(ret+F(4+x))%P;if(ok(1+x,4+x)&&ok(4+x,2+x)&&ok(2+x,5+x)&&ok(6+x,3+x)&&ok(3+x,0+x))ret=(ret+F(5+x))%P;return g[x]=ret;
}
inline int Work(){int i,x,y,d=100000,ans=0;for(i=1;i<=k;++i){read(x),read(y);x=n-x,y=n-y;if(std::abs(x-y)<=3)no(x,y-x)=true;}if(n<=7){if(ok(1,0))ans=(ans+D(0,0,1))%P;if(ok(2,0))ans=(ans+D(0,0,2))%P;if(n>=4&&ok(3,0))ans=(ans+D(0,0,3))%P;printf("%d\n",ans);return 0;}for(i=n-d;i>d;i-=d)G(i),F(i);/*为了防止爆栈和MLE*/if(ok(1,0))ans=(ans+F(0))%P;if(ok(2,0)&&ok(0,1))ans=(ans+F(1))%P;if(ok(4,1)&&ok(1,2)&&ok(2,0)&&ok(0,3))ans=(ans+F(3))%P;if(ok(5,2)&&ok(2,0)&&ok(0,3)&&ok(3,1)&&ok(1,4))ans=(ans+F(4))%P;if(ok(3,0)&&ok(0,1)&&ok(1,2))ans=(ans+F(2))%P;if(ok(5,2)&&ok(2,3)&&ok(3,0)&&ok(0,1)&&ok(1,4))ans=(ans+F(4))%P;if(ok(6,3)&&ok(3,0)&&ok(0,1)&&ok(1,4)&&ok(4,2)&&ok(2,5))ans=(ans+F(5))%P;if(ok(3,0)&&ok(0,2)&&ok(2,1)&&ok(1,4))ans=(ans+G(3))%P;if(ok(4,1)&&ok(1,3)&&ok(3,0)&&ok(0,2)&&ok(2,5))ans=(ans+G(4))%P;printf("%d\n",ans);return 0;
}
int main(){//freopen("cza.in","r",stdin);//freopen("cza.out","w",stdout);
  read(n),read(k),read(p);if(n==1)return puts("1"),0;if(p==0)return puts("0"),0;if(n==2)return puts(k?"0":"1"),0;if(p==1)return puts("0"),0;if(p==2)return work(),0;return Work(),0;
}