Problem: Childan is making up a legendary story and trying to sell his forgery — a necklace with a strong sense of "Wu" to the Kasouras. But Mr. Kasoura is challenging the truth of Childan's story. So he is going to ask a few questions about Childan's so-called "personal treasure" necklace.

This "personal treasure" is a multiset S of m "01-strings".

A "01-string" is a string that contains n characters "0" and "1". For example, if n=4, strings "0110", "0000", and "1110" are "01-strings", but "00110" (there are 5 characters, not 4) and "zero" (unallowed characters) are not.

Note that the multiset S can contain equal elements.

Frequently, Mr. Kasoura will provide a "01-string" t and ask Childan how many strings s are in the multiset S such that the "Wu" value of the pair (s, t) is not greater than k. 

Mrs. Kasoura and Mr. Kasoura think that if s_i = t_i (1≤ i≤ n) then the "Wu" value of the character pair equals to w_i, otherwise 0. The "Wu" value of the "01-string" pair is the sum of the "Wu" values of every character pair. Note that the length of every "01-string" is equal to n.

For example, if w=[4, 5, 3, 6], "Wu" of ("1001", "1100") is 7 because these strings have equal characters only on the first and third positions, so w_1+w_3=4+3=7.

You need to help Childan to answer Mr. Kasoura's queries. That is to find the number of strings in the multiset S such that the "Wu" value of the pair is not greater than k.

Input

The first line contains three integers n, m, and q (1≤ n≤ 12, 1≤ q, m≤ 5⋅ 10^5) — the length of the "01-strings", the size of the multiset S, and the number of queries.

The second line contains n integers w_1, w_2, …, w_n (0 ≤ w_i ≤ 100) — the value of the i-th caracter.

Each of the next m lines contains the "01-string" s of length n — the string in the multiset S.

Each of the next q lines contains the "01-string" t of length n and integer k (0≤ k≤ 100) — the query.

Output

For each query, print the answer for this query.

Examples

Input

2 4 5
40 20
01
01
10
11
00 20
00 40
11 20
11 40
11 60


Output

2
4
2
3
4


Input

1 2 4
100
0
1
0 0
0 100
1 0
1 100


Output

1
2
1
2

Note

In the first example, we can get:

"Wu" of ("01", "00") is 40.

"Wu" of ("10", "00") is 20.

"Wu" of ("11", "00") is 0.

"Wu" of ("01", "11") is 20.

"Wu" of ("10", "11") is 40.

"Wu" of ("11", "11") is 60.

In the first query, pairs ("11", "00") and ("10", "00") satisfy the condition since their "Wu" is not greater than 20.

In the second query, all strings satisfy the condition.

In the third query, pairs ("01", "11") and ("01", "11") satisfy the condition. Note that since there are two "01" strings in the multiset, the answer is 2, not 1.

In the fourth query, since k was increased, pair ("10", "11") satisfies the condition too.

In the fifth query, since k was increased, pair ("11", "11") satisfies the condition too.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int maxn = 2e6 + 5;
int tree[maxn][3];
int sz[maxn];
bool flagg[maxn];
int tot;
int w[20], sum[20];
char ch[20];
int ans, k;
int n, m, q;
struct node {
  int w, id;
} no[20];
void insert_(char *str) {
  int root = 0;
  for (int j = 0; j < n; j++) {
    int i = no[j].id;
    int id = str[i] - '0';
    if (!tree[root][id]) tree[root][id] = ++tot;
    root = tree[root][id];
    sz[root]++;
  }
  flagg[root] = true;
}
char qs[20];
int lenqs;
int total;
void find_(int cnt, int fa = 0, int root = 0, int val = 0) {
  if (cnt >= lenqs) {
    ans += sz[root];
    return;
  }
  int id = qs[no[cnt].id] - '0';
  if (!tree[root][id]) {
    int rt = tree[root][!id];
    if (rt == 0) {
      ans += sz[fa];
      return;
    }
    find_(cnt + 1, root, rt, val);
  } else {
    if ((val + w[no[cnt].id] + total - sum[cnt]) <= k) {
      ans += sz[root];
      return;
    }
    int rt1 = 0;
    rt1 = tree[root][id];
    if (val + w[no[cnt].id] <= k) {
      if (rt1 != 0) {
        find_(cnt + 1, root, rt1, val + w[no[cnt].id]);
      }
    }
    int rt2 = 0;
    rt2 = tree[root][!id];
    if (rt1 == 0 && rt2 == 0) {
      ans += sz[fa];
      return;
    }
    if (rt2 == 0) return;
    find_(cnt + 1, root, rt2, val);
  }
}
bool cmp(const node &o, const node &t) { return o.w > t.w; }
int main(void) {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &w[i]);
    total += w[i];
    no[i].w = w[i];
    no[i].id = i;
  }
  sort(no, no + n, cmp);
  sz[0] = m;
  for (int i = 0; i < n; ++i) {
    if (i > 0) sum[i] = sum[i - 1];
    sum[i] += no[i].w;
  }
  for (int i = 1; i <= m; ++i) {
    scanf("%s", ch);
    insert_(ch);
  }
  for (int i = 1; i <= q; ++i) {
    ans = 0;
    scanf("%s%d", qs, &k);
    if (k >= total) {
      printf("%d\n", m);
      continue;
    }
    lenqs = strlen(qs);
    find_(0);
    printf("%d\n", ans);
  }
}