#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];
struct pp{long long q,w;}dp[5001][5001];
void ins(int ll,int rr,long long q1,long long q2)
{
	if(ll>rr) return;
//	cout<<ll<<" "<<rr<<" "<<q1<<"\n";
	sm1[ll]+=q1,sm1[rr+1]-=q1;
	sm2[ll]+=q2,sm2[rr+1]-=q2;
}
int main()
{
//	freopen("game17.in","r",stdin);
//	freopen("game17.ans","w",stdout);
	a=read(),b=read(),c=read();
	for(int i=1;i<=a;i++)
	{
		q=read(),w=read();
		d[i]=q;
	}
	long long L=1;
	for(int i=1;i<=a;i++)
	{
		if(i==a) dp[i][i]=pp{L,lim};
		else dp[i][i]=pp{L,(d[i]+d[i+1])/2};
		L=dp[i][i].w+1;
		ins(dp[i][i].q,dp[i][i].w,d[i],0);
	}
	for(int i=2;i<=a;i++)
	{
		for(int j=1;j<=a-i+1;j++)
		{
			int r=j+i-1;
			int l1,r1,l2,r2;
			int ml=1e9,mr=0;
			l1=dp[j][r-1].q,r1=dp[j][r-1].w;
			l2=dp[j+1][r].q,r2=dp[j+1][r].w;
			if(i%2==1)
			{
				if(j>1)
				{
					l1=max(l1,(d[j-1]+d[r])/2+1);
				}
				if(r<a)
				{
					r2=min(r2,(d[j]+d[r+1])/2);
				}
				if(l1<=r1) ml=min(ml,l1),mr=max(mr,r1),ins(l1,r1,d[r],0);
				if(l2<=r2) ml=min(ml,l2),mr=max(mr,r2),ins(l2,r2,d[j],0);
			}
			else
			{
				if(j>1)
				{
					l1=max(l1,(d[j-1]+d[r]-2)/2+1);
				}
				if(r<a)
				{
					r2=min(r2,(d[j]+d[r+1]-2)/2);
				}
				if(l1<=r1) ml=min(ml,l1),mr=max(mr,r1);
				if(l2<=r2) ml=min(ml,l2),mr=max(mr,r2);
			}
			dp[j][r]=pp{ml,mr};
		}
	}
	for(int i=1;i<=lim;i++) sm1[i]+=sm1[i-1];
	for(int i=0;i<=lim;i++) an[i]=sm1[i];
	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;
}