#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, Q, K;
vector<int> L, R;
vector<int> X;

namespace sub3 {
Int dp[5010][5010][2][2];
vector<Int> run() {
cerr<<"[sub3::run]"<<endl;
  if (N == 1) {
    return vector<Int>(Q, L[0]);
  }
  for (int i = 0; i <= N; ++i) for (int j = N; j >= i + 2; --j) {
    for (int s = 0; s < 2; ++s) for (int t = 0; t < 2; ++t) {
      if (i == 0 && j == N) {
        dp[i][j][s][t] = 0;
      } else {
        int b = (s == 0) ? i : (j - 1);
        int a = (s == 0) ? ((t == 0) ? (i + 1) : (j - 1)) : ((t == 0) ? i : (j - 2));
        int ii = i, jj = j;
        Int c = 0;
        if (ii != 0 && (jj == N || L[a] - L[ii - 1] <= L[jj] - L[a])) {
          c += L[a = --ii];
        } else {
          c += L[a = jj++];
        }
        if (ii != 0 && (jj == N || L[b] - L[ii - 1] <= L[jj] - L[b])) {
          b = --ii;
        } else {
          b = jj++;
        }
        const int ss = (b == ii) ? 0 : 1;
        const int tt = (a == ((ss == 0) ? (ii + 1) : ii)) ? 0 : 1;
        assert(b == ((ss == 0) ? ii : (jj - 1)));
        assert(a == ((ss == 0) ? ((tt == 0) ? (ii + 1) : (jj - 1)) : ((tt == 0) ? ii : (jj - 2))));
        dp[i][j][s][t] = c + dp[ii][jj][ss][tt];
      }
    }
  }
  vector<Int> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    int a, b;
    int ii = lower_bound(L.begin(), L.end(), X[q]) - L.begin();
    int jj = ii;
    if (ii != 0 && (jj == N || X[q] - L[ii - 1] <= L[jj] - X[q])) {
      ans[q] += L[a = --ii];
    } else {
      ans[q] += L[a = jj++];
    }
    if (ii != 0 && (jj == N || (X[q] + K) - L[ii - 1] <= L[jj] - (X[q] + K))) {
      b = --ii;
    } else {
      b = jj++;
    }
    const int ss = (b == ii) ? 0 : 1;
    const int tt = (a == ((ss == 0) ? (ii + 1) : ii)) ? 0 : 1;
    assert(b == ((ss == 0) ? ii : (jj - 1)));
    assert(a == ((ss == 0) ? ((tt == 0) ? (ii + 1) : (jj - 1)) : ((tt == 0) ? ii : (jj - 2))));
// cerr<<X[q]<<": "<<ii<<" "<<jj<<" "<<ss<<" "<<tt<<endl;
    ans[q] += dp[ii][jj][ss][tt];
  }
  return ans;
}
}  // sub3

int main() {
  for (; ~scanf("%d%d%d", &N, &Q, &K); ) {
    L.resize(N);
    R.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%d", &L[i], &R[i]);
    }
    X.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &X[q]);
    }
    
    vector<Int> ans;
    if (L == R) {
      ans = sub3::run();
    } else {
      ans.assign(Q, 0);
    }
// cerr<<"ans = "<<ans<<endl;
    Int key = 0;
    for (int q = 0; q < Q; ++q) {
      key ^= ((q + 1) * ans[q]);
    }
    printf("%lld\n", key);
  }
  return 0;
}