#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 100005
#define M 10
int n, m, T, a[N], b[N], p[N], q[N], id[N];
bool u[N]; vector<int> cnt[M][N], c[M];
il void WORK() {
  FOR(i, 1, m) cin >> a[i] >> b[i], a[i + m] = a[i], b[i + m] = b[i];
  FOR(r, 0, m - 1) {
    vector<int>().swap(c[r]);
    FOR(i, 1, n) vector<int>().swap(cnt[r][i]);
    FOR(i, 1, n) p[i] = q[i] = i, u[i] = 0, id[i] = -1;
    FOR(i, 1, r) reverse(p + a[i], p + b[i] + 1);
    FOR(i, 1, m) reverse(q + a[i + r], q + b[i + r] + 1);
    FOR(i, 1, n) if(!u[i]) {
      int x = i, k = 0; vector<int> v;
      while(!u[x]) u[x] = 1, id[x] = k++, v.eb(x), x = q[x];
      cnt[r][k].resize(k), c[r].eb(k);
      for(auto x : v) {
        if(id[p[x]] == -1) continue;
        ++cnt[r][k][(id[x] - id[p[x]] + k) % k];
      }
      for(auto x : v) id[x] = -1;
    }
    sort(ALL(c[r])), c[r].erase(unique(ALL(c[r])), c[r].end());
  }
  while(T--) {
    int k; cin >> k;
    int r = k % m, t = k / m, ans = 0;
    for(auto x : c[r]) ans += cnt[r][x][t % x];
    cout << ans << "\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  while(cin >> n >> m >> T) WORK();
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}