#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 1e6 + 5, mod = 1e9 + 7;
int n, K, Q, a[N], f[M], g[M];
int fac[M], inv[M], ans;
inline int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') f = ch == '-' ? -1 : f, ch = getchar();
  while (ch >= '0' && ch <= '9')
    s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
  return s * f;
}
inline int qpow(int x, int y, int res = 1) {
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    y >>= 1;
    x = 1ll * x * x % mod;
  }
  return res;
}
inline int com(int x, int y) {
  if (x < y) return 0;
  return 1ll * fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int p[M], yet[M], phi[M], tot;
inline void get_prime() {
  const int lim = 1e6;
  phi[1] = 1;
  for (int i = 2; i <= lim; ++i) {
    if (!yet[i]) p[++tot] = i, phi[i] = i - 1;
    for (int j = 1; j <= tot && p[j] * i <= lim; ++j) {
      yet[p[j] * i] = 1;
      if (!(i % p[j])) {
        phi[p[j] * i] = phi[i] * p[j];
        break;
      }
      phi[p[j] * i] = phi[i] * phi[p[j]];
    }
  }
}
vector<int> v;
inline void add(int x) {
  v.clear();
  for (int i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      v.push_back(i);
      g[i]++;
      if (i * i != x) v.push_back(x / i), g[x / i]++;
    }
  }
}
int main() {
  n = read(), K = read(), Q = read();
  const int lim = 1e6;
  fac[0] = 1;
  get_prime();
  for (int i = 1; i <= lim; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[lim] = qpow(fac[lim], mod - 2);
  for (int i = lim; i >= 1; --i) inv[i - 1] = 1ll * inv[i] * i % mod;
  for (int i = 1; i <= n; ++i) a[i] = read(), add(a[i]);
  for (int i = 1; i <= lim; ++i)
    (ans += 1ll * phi[i] * com(g[i], K) % mod) %= mod;
  for (int i = 1; i <= Q; ++i) {
    int x = read();
    add(x);
    for (int j = 0; j < v.size(); ++j) {
      int y = v[j];
      (ans += mod - 1ll * phi[y] * com(g[y] - 1, K) % mod) %= mod;
      (ans += 1ll * phi[y] * com(g[y], K) % mod) %= mod;
    }
    printf("%d\n", ans);
  }
  return 0;
}
