Problem: In an attempt to make peace with the Mischievious Mess Makers, Bessie and Farmer John are planning to plant some flower gardens to complement the lush, grassy fields of Bovinia. As any good horticulturist knows, each garden they plant must have the exact same arrangement of flowers. Initially, Farmer John has n different species of flowers he can plant, with ai flowers of the i-th species.

On each of the next q days, Farmer John will receive a batch of flowers of a new species. On day j, he will receive cj flowers of the same species, but of a different species from those Farmer John already has. 

Farmer John, knowing the right balance between extravagance and minimalism, wants exactly k species of flowers to be used. Furthermore, to reduce waste, each flower of the k species Farmer John chooses must be planted in some garden. And each of the gardens must be identical; that is to say that each of the k chosen species should have an equal number of flowers in each garden. As Farmer John is a proponent of national equality, he would like to create the greatest number of gardens possible.

After receiving flowers on each of these q days, Farmer John would like to know the sum, over all possible choices of k species, of the maximum number of gardens he could create. Since this could be a large number, you should output your result modulo 109 + 7.

Input

The first line of the input contains three integers n, k and q (1 ≤ k ≤ n ≤ 100 000, 1 ≤ q ≤ 100 000).

The i-th (1 ≤ i ≤ n) of the next n lines of the input contains an integer ai (1 ≤ ai ≤ 1 000 000), the number of flowers of species i Farmer John has initially.

The j-th (1 ≤ j ≤ q) of the next q lines of the input contains an integer cj (1 ≤ cj ≤ 1 000 000), the number of flowers of a new species Farmer John receives on day j.

Output

After each of the q days, output the sum of the maximum possible number of gardens, where the sum is taken over all possible choices of k species, modulo 109 + 7.

Examples

Input

3 3 2
4
6
9
8
6


Output

5
16


Input

4 1 2
6
5
4
3
2
1


Output

20
21

Note

In the first sample case, after the first day Farmer John has (4, 6, 9, 8) of each type of flower, and k = 3.

Choosing (4, 6, 8) lets him make 2 gardens, each with (2, 3, 4) of each flower, respectively. Choosing (4, 6, 9), (4, 9, 8) and (6, 9, 8) each only let him make one garden, since there is no number of gardens that each species can be evenly split into. So the sum over all choices of k = 3 flowers is 2 + 1 + 1 + 1 = 5.

After the second day, Farmer John has (4, 6, 9, 8, 6) of each flower. The sum over all choices is 1 + 2 + 2 + 1 + 1 + 2 + 2 + 3 + 1 + 1 = 16.

In the second sample case, k = 1. With x flowers Farmer John can make x gardens. So the answers to the queries are 6 + 5 + 4 + 3 + 2 = 20 and 6 + 5 + 4 + 3 + 2 + 1 = 21.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using namespace std;
bool solve(int);
int main() {
  int test = 0;
  while (solve(test++))
    ;
  return 0;
}
const int N = 1000 * 1000 + 5;
int n, k, q;
int ways[N], a[N];
int cnt[N];
int coef[N];
const int A = 1000 * 1000;
int lp[A + 1];
const int MOD = int(1e9) + 7;
int C[N];
void inc(int &a, int b) {
  a = (a + b);
  if (a >= MOD) a -= MOD;
}
void dec(int &a, int b) {
  a = a - b;
  if (a < 0) a += MOD;
}
int mul(int a, int b) { return a * 1ll * b % MOD; }
int gcd_ext(int a, int b, int &first, int &second) {
  if (b == 0) {
    first = 1, second = 0;
    return a;
  }
  int xx, yy;
  int g = gcd_ext(b, a % b, xx, yy);
  first = yy;
  second = xx - yy * (a / b);
  return g;
}
int rev(int first) {
  int u, v;
  assert(gcd_ext(first, MOD, u, v) == 1);
  u = (u % MOD + MOD) % MOD;
  assert(mul(first, u) == 1);
  return u;
}
int res = 0;
void incj(int j) {
  dec(res, mul(coef[j], C[cnt[j]]));
  cnt[j]++;
  inc(res, mul(coef[j], C[cnt[j]]));
}
bool solve(int) {
  if (!(cin >> n >> k >> q)) return false;
  for (int i = 2; i <= A; ++i) {
    if (lp[i] == 0) {
      for (int j = i; j <= A; j += i) lp[j] = i;
    }
  }
  for (int j = 1; j <= A; ++j) {
    int v = j;
    int par = 0;
    while (v != 1) {
      int p = lp[v];
      int pw = 0;
      while (v % p == 0) {
        pw++;
        v /= p;
      }
      par ^= 1;
      if (pw > 1) {
        par = -1;
        break;
      }
    }
    if (par == -1) continue;
    for (int i = j; i <= A; i += j) {
      if (par)
        dec(coef[i], i / j);
      else
        inc(coef[i], i / j);
    }
  }
  memset(C, 0, sizeof(C));
  C[k] = 1;
  for (int i = k + 1; i < N; ++i) {
    C[i] = mul(C[i - 1], mul(i, rev(i - k)));
  }
  for (int i = 0; i < int(n); ++i) {
    assert(scanf("%d", &a[i]) == 1);
    for (int j = 1; j * j <= a[i]; ++j) {
      if (a[i] % j == 0) {
        incj(j);
        if (j * j != a[i]) incj(a[i] / j);
      }
    }
  }
  for (int i = 0; i < int(q); ++i) {
    int c;
    assert(scanf("%d", &c));
    a[i] = c;
    for (int j = 1; j * j <= a[i]; ++j) {
      if (a[i] % j == 0) {
        incj(j);
        if (j * j != a[i]) incj(a[i] / j);
      }
    }
    printf("%d\n", res);
  }
  return false;
}