#include<bits/stdc++.h>
using namespace std;
long long a,b,c,q,w,sum[200005],cn,lim=5000000;
long long an1[10000005];
unsigned long long ann[10000005],an[10000005],ans;
long long sm1[10000005],sm2[10000005];
int d[5000005],v[5000005],cnn;
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
struct p{long long l,r;}l[200005];
void ins(int ll,int rr,long long q1,long long q2)
{
	if(ll>rr) return;
	sm1[ll]+=q1,sm1[rr+1]-=q1;
	sm2[ll]+=q2,sm2[rr+1]-=q2;
}
int main()
{
	a=read(),b=read(),c=read();
	for(int i=1;i<=a;i++) q=read(),w=read(),v[q]++,v[w+1]--;
	for(int i=1;i<=lim;i++) v[i]+=v[i-1];
	for(int i=1;i<=lim;i++)
	{
		if(v[i]) d[++cnn]=i;
	}
	sum[0]=0;
	for(int i=0;i<=lim;i++) an[i]=0;
	for(int i=cnn;i>=1;i-=2) an[lim]+=d[i];
	long long la=1;cn=0;
	for(int i=2;i<=cnn;i++)
	{
		if(d[i]!=d[i-1]+1) l[++cn]=p{d[la],d[i-1]},la=i;
	}l[++cn]=p{d[la],d[cnn]};
	for(int i=1;i<=cn;i++) sum[i]=sum[i-1]+l[i].r-l[i].l+1;
	for(int i=0;i<=lim*2;i++) sm1[i]=sm2[i]=0;
	if(c==1)
	{
		for(int i=1;i<=cn;i++)
		{
			for(int j=i+1;j<=cn;j++)
			{
				if((sum[j-1]-sum[i]+l[j].l-l[i].r)%2==0)
				{
					long long l1=l[i].l,r1=l[i].r,l2=l[j].l,r2=l[j].r;
					if((r1+l2)%2==0)
					{
						long long tt=r1+l2;
						long long L=max(l1,l2+r1-r2),R=r1;
						if(L<=R)
						{
							an1[tt-1]-=(R-L+1)*(R+L)-tt*(R-L+1);
							an1[tt+1]+=(R-L+1)*(R+L)-tt*(R-L+1);
						}
					}
					long long R=min(l1+r2,r1+l2);
					ins(l1+l2,R,-(l1+l2-1)*(l1-l2),(l1-l2));
					ins(R+1,r1+l2,-(r2-l2+1)*(r2+l2),(r2-l2+1));
				}
			}
		}
		for(int i=1;i<=lim*2;i++)
		{
			sm1[i]+=sm1[i-1];sm2[i]+=sm2[i-1];
			if(i%2==0) an1[i-1]+=sm1[i]+sm2[i]*i;
			else an1[i-1]-=sm1[i]+sm2[i]*i;
		}
		for(int i=0;i<=lim*2;i++) sm1[i]=sm2[i]=0;
		for(int i=1;i<=cn;i++)
		{
			for(int j=i+1;j<=cn;j++)
			{
				if((sum[j-1]-sum[i]+l[j].l-l[i].r)%2==0)
				{
					long long l1=l[i].l,r1=l[i].r,l2=l[j].l,r2=l[j].r;
					long long L=max(r1+l2,l1+r2);
					ins(r1+l2+1,L,(l1-r1-1)*(-r1-l1),(l1-r1-1));
					ins(L+1,r1+r2,(r2+r1+1)*(r1-r2),(-r1+r2));
				}
			}
		}
		for(int i=1;i<=lim*2;i++)
		{
			sm1[i]+=sm1[i-1];sm2[i]+=sm2[i-1];
			if(i%2==0) an1[i+1]+=sm1[i]+sm2[i]*i;
			else an1[i+1]-=sm1[i]+sm2[i]*i;
		}
		for(int i=0;i<=lim*2;i++) sm1[i]=sm2[i]=0;
		for(int i=1;i<=cn;i++)
		{
			for(int j=i+1;j<=cn;j++)
			{
				if((sum[j-1]-sum[i]+l[j].l-l[i].r)%2==1)
				{
					long long l1=l[i].l,r1=l[i].r,l2=l[j].l,r2=l[j].r;
					if(l1+r2<=r1+l2)
					{
						ins(l1+l2,l1+r2,(l2-l1)*(-l2-l1+1),(l2-l1));
						ins(l1+r2+1,r1+l2,(r2+l2)*(r2-l2+1),(l2-r2-1));
						ins(r1+l2+1,r1+r2,(r1+r2+1)*(r2-r1),(r1-r2));
					}
					else
					{
						ins(l1+l2,r1+l2,(l2-l1)*(-l2-l1+1),(l2-l1));
						ins(r1+l2+1,l1+r2,(-l1-r1)*(r1-l1+1),(r1-l1+1));
						ins(l1+r2+1,r1+r2,(r1+r2+1)*(r2-r1),(r1-r2));
					}
				}
			}
		}
		for(int i=1;i<=lim*2;i++)
		{
			sm1[i]+=sm1[i-1];sm2[i]+=sm2[i-1];
			if(i%2==0) an1[i]+=sm1[i]+sm2[i]*i;
			else an1[i]-=sm1[i]+sm2[i]*i;
		}
		for(int i=1;i<=cn;i++)
		{
			for(int j=l[i].l*2+1;j<=l[i].r*2-1;j++)
			{
				long long L=max(j-l[i].r,l[i].l),R=(j-1)/2;
				if(j%2==1)
				{
					an1[j]+=-j*(R-L+1);
					an1[j]+=(L+R)*(R-L+1);
				}
				else
				{
					an1[j]+=j*(R-L+1);
					an1[j]+=-(L+R)*(R-L+1);
				}
			}
		}
		for(int i=1;i<=lim;i++) ann[i]+=an1[i*2-1]+an1[i*2];
		for(int i=lim-1;i>=0;i--) an[i]=an[i+1]+ann[i+1];
	}
	else
	{
		for(int i=0;i<=lim;i++) ann[i]=0;
		for(int i=0;i<=lim*2;i++) an1[i]=0;
		for(int i=cnn;i>=1;i-=2) ann[lim]+=d[i];
		for(int i=1;i<=cn;i++)
		{
			for(int j=l[i].l*2+1;j<=l[i].r*2-1;j++)
			{
				long long L=max(j-l[i].r,l[i].l),R=(j-1)/2;
				if(j%2==1) an1[j]+=(R-L+1)*(L+R)-(R-L+1)*j;
				else an1[j]-=(R-L+1)*(L+R)-(R-L+1)*j;
			}
		}
		for(int i=0;i<=lim*2;i++) sm1[i]=sm2[i]=0;
		for(int i=1;i<=cn;i++)
		{
			for(int j=i+1;j<=cn;j++)
			{
				int tt=1;
				long long l1=l[i].l,r1=l[i].r,l2=l[j].l,r2=l[j].r;
				if((sum[j-1]+sum[i]+l2+r1)%2==1) tt=-1;
				if(r2+l1<=r1+l2)
				{
					ins(l1+l2,l1+r2,(l1-l2)*(-l2-l1+1)*tt,(l1-l2)*tt);
					ins(l1+r2+1,r1+l2,(-l2-r2)*(r2-l2+1)*tt,(r2-l2+1)*tt);
					ins(r1+l2+1,r1+r2,(r1-r2)*(r1+r2+1)*tt,(r2-r1)*tt);
				}
				else
				{
					ins(l1+l2,r1+l2,(l1-l2)*(-l2-l1+1)*tt,(l1-l2)*tt);
					ins(r1+l2+1,l1+r2,(r1+l1)*(r1-l1+1)*tt,(l1-r1-1)*tt);
					ins(l1+r2+1,r1+r2,(r1-r2)*(r1+r2+1)*tt,(r2-r1)*tt);
				}
			}
		}
		for(int i=1;i<=lim*2;i++)
		{
			sm1[i]+=sm1[i-1];sm2[i]+=sm2[i-1];
			if(i%2==0) an1[i]+=sm1[i]+sm2[i]*i;
			else an1[i]-=sm1[i]+sm2[i]*i;
		}
		for(int i=lim-1;i>=0;i--) ann[i]=an1[i*2]+an1[i*2+1]+ann[i+1];
	}
	for(int i=1;i<=b;i++)
	{
		q=read();
		if(c==0) ans=ans^(ann[q]*i);
		else ans=ans^(an[q]*i);
	}
	printf("%llu",ans);
	return 0;
}