#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 5e5 + 5;
int n, m, q;
int a[mx];
int b[mx];
int tree[mx * 4];
vector<int> vec[mx];
int ans[mx];
vector<pair<long long, long long> > queries;
void update(int node, int l, int r, int b, int x) {
  if (l == r) {
    tree[node] += x;
    return;
  }
  int mid = (l + r) / 2;
  if (mid >= b)
    update(2 * node, l, mid, b, x);
  else
    update(2 * node + 1, mid + 1, r, b, x);
  tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int query(int node, int l, int r, int k) {
  if (l == r) return l;
  int mid = (l + r) / 2;
  if (tree[2 * node] >= k)
    return query(2 * node, l, mid, k);
  else
    return query(2 * node + 1, mid + 1, r, k - tree[2 * node]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    ++b[a[i]];
  }
  for (int i = 1; i <= m; ++i) {
    vec[b[i]].push_back(i);
  }
  for (int i = 0; i < q; ++i) {
    long long k;
    cin >> k;
    queries.push_back(make_pair(k, i));
  }
  sort(queries.begin(), queries.end());
  long long day = n;
  long long cnt = (int)vec[0].size();
  for (auto x : vec[0]) update(1, 1, m, x, 1);
  int idx = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = idx; j < q; ++j) {
      if (queries[j].first <= day + cnt) {
        ans[queries[j].second] = query(1, 1, m, queries[j].first - day);
        idx = j + 1;
      } else {
        idx = j;
        break;
      }
    }
    day += cnt;
    cnt += (int)vec[i].size();
    for (auto x : vec[i]) update(1, 1, m, x, 1);
  }
  for (int i = idx; i < q; ++i) {
    long long temp = (queries[i].first - day) % cnt;
    if (temp == 0) temp = m;
    ans[queries[i].second] = temp;
  }
  for (int i = 0; i < q; ++i) cout << ans[i] << '\n';
}
