#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int MAXN = 1000 * 1001;
int norm(int a) {
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
  return a;
}
long long ans = 0;
int n, k, q;
int d[MAXN];
long long fact[MAXN], _fact[MAXN];
long long _pow(long long a, long long deg) {
  if (deg == 0) return 1;
  if (deg % 2 == 0) {
    return _pow((a * a) % mod, deg / 2);
  }
  return (a * _pow(a, deg - 1)) % mod;
}
int C(int a, int b) {
  if (a > b) {
    return 0;
  }
  return (int)(((fact[b] * _fact[b - a]) % mod * _fact[a]) % mod);
}
int phi(int a) {
  if (a == 1) {
    return 1;
  }
  int ans = 1;
  for (int i = 2; i * i <= a; i++) {
    if (a % i == 0) {
      int cur = 1;
      while (a % i == 0) {
        a /= i;
        cur *= i;
      }
      ans *= (cur - cur / i);
    }
  }
  if (a > 1) {
    ans *= a - 1;
  }
  return ans;
}
void add(int a) {
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      int g = C(k, d[i]);
      ans = (ans + mod - phi(i) * (long long)g) % mod;
      d[i]++;
      g = C(k, d[i]);
      ans = (ans + mod + phi(i) * (long long)g) % mod;
      if (i * i != a) {
        int div = a / i;
        int g = C(k, d[div]);
        ans = (ans + mod - phi(div) * (long long)g) % mod;
        d[div]++;
        g = C(k, d[div]);
        ans = (ans + mod + phi(div) * (long long)g) % mod;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  fact[0] = _fact[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    _fact[i] = _pow(fact[i], mod - 2);
  }
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    add(a);
  }
  for (int i = 0; i < q; i++) {
    int a;
    cin >> a;
    add(a);
    cout << ans << '\n';
  }
  return 0;
}
