#include <cstdio>
#include <algorithm>

int n, m, type;
int a[1010];
unsigned long long res = 0;

int main() {
  freopen("sequence.in", "r", stdin);
  freopen("sequence.out", "w", stdout);
  scanf("%d %d %d", &n, &m, &type);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
  }
  for (int i = 1, L, R; i <= m; ++i) {
    unsigned long long ans = 0;
    scanf("%d %d", &L, &R);
    for (int l = L; l <= R; ++l) {
      int minn = a[l]; 
      for (int r = l; r <= R; ++r) {
        minn = std::min(minn, a[r]);
        ans += minn;
      }
    }
    res ^= ans;
  }
  printf("%llu\n", res);
  return 0;
}