#include <bits/stdc++.h>
using namespace std;
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  }
  stringstream ss;
} _;
template <class A, class B>
ostream &operator<<(ostream &o, pair<A, B> t) {
  o << "(" << t.first << ", " << t.second << ")";
  return o;
}
template <class T>
inline string tostring(T first) {
  _.ss.clear();
  _.ss.str("");
  _.ss << first;
  return _.ss.str();
}
template <class T>
inline T convert(const string &s) {
  char *p;
  if (is_integral<T>())
    return strtoll(s.c_str(), &p, 10);
  else
    return strtod(s.c_str(), &p);
}
template <class T>
void PV(T a, T b, int p = 0, int w = 0, string s = " ") {
  int c = 0;
  while (a != b) {
    cout << setw(w) << *a++;
    cout << ((a != b && (!p || ++c % p)) ? s : "\n");
  }
  cout.flush();
}
template <class T>
inline bool chmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
inline bool chmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
const long long linf = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
const int mod = int(1e9) + 7;
const int N = 1000010;
vector<int> primes, minFactor;
vector<bool> isp;
vector<int> mu;
struct PRIME {
  PRIME(int n = 1000010) {
    n++, isp.resize(n, 1), isp[0] = isp[1] = 0;
    for (int i = 0; i < n; i++) minFactor.push_back(i);
    for (int i = 2; i < n; i++) {
      if (!isp[i]) continue;
      primes.push_back(i);
      for (int j = i + i; j < n; j += i) {
        isp[j] = 0;
        chmin(minFactor[j], i);
      }
    }
    mu.resize(n);
    for (int i = 1; i < n; i++) {
      int cnt = 0;
      int first = i;
      while (first != 1) {
        int t = minFactor[first];
        first /= t;
        if (first % t == 0) break;
        cnt++;
      }
      if (first != 1) continue;
      if (cnt % 2)
        mu[i] = -1;
      else
        mu[i] = 1;
    }
  }
} _PRIME;
inline long long exp(long long first, long long n, long long m = mod) {
  if (m == 0) m = LLONG_MAX;
  first = first % m;
  if (first < 0) first += m;
  if (first == 0 || m == 1) return 0;
  long long r = 1;
  while (n > 0) {
    if (n & 1) r = r * first % m;
    first = first * first % m;
    n >>= 1;
  }
  return r;
}
const int Z = 1000010;
long long ff[Z], iff[Z];
struct Factorial {
  Factorial(int n = Z) {
    ff[0] = 1;
    for (int i = 1; i < n; i++) ff[i] = ff[i - 1] * i % mod;
    iff[n - 1] = exp(ff[n - 1], mod - 2);
    for (int i = n - 1; i > 0; i--) iff[i - 1] = iff[i] * i % mod;
  }
} FF;
inline long long C(int n, int m) {
  if (m < 0 || m > n) return 0;
  return ff[n] * iff[m] % mod * iff[n - m] % mod;
}
vector<long long> allFactor(long long n) {
  vector<long long> R;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      R.push_back(i);
      if (i * i != n) R.push_back(n / i);
    }
  sort((R).begin(), (R).end());
  return R;
}
int n, k, q;
int c[N];
int cnt[N];
long long cnt2[N];
long long mug[N];
int main() {
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int first;
    cin >> first;
    cnt[first]++;
  }
  for (int i = 1; i < N; i++)
    for (int j = i; j < N; j += i) cnt2[i] += cnt[j];
  for (int i = 1; i < N; i++)
    for (int j = i; j < N; j += i) mug[j] += mu[i] * (j / i);
  long long res = 0;
  for (int i = 1; i < N; i++) {
    res += C(cnt2[i], k) * mug[i] % mod;
  }
  for (int i = 0; i < q; i++) {
    int first;
    cin >> first;
    vector<long long> v = allFactor(first);
    for (int j : v) {
      res -= C(cnt2[j], k) * mug[j] % mod;
      cnt2[j]++;
      res += C(cnt2[j], k) * mug[j] % mod;
    }
    res = (res % mod + mod) % mod;
    cout << res << "\n";
  }
  return 0;
}
