#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int w[15];
char s[15];
int a[5000], num[5000];
int f[5005][5005];
int gl[5005], p[5005];
int numm[105], ans[500005];
int tot;
struct Que {
  int x;
  int t;
  int num;
} que[500005];
bool cmp(Que a, Que b) {
  if (a.x != b.x)
    return a.x < b.x;
  else
    return a.t < b.t;
}
int Js(int x, int y) {
  int i = n, ans = 0;
  while (i != 0) {
    if ((x & 1) == (y & 1)) ans += w[i];
    i--;
    x >>= 1;
    y >>= 1;
  }
  return ans;
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  int nn = (1 << n) - 1;
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i <= m; i++) {
    int x = 0;
    scanf("%s", s + 1);
    for (int i = 1; i <= n; i++) x = x * 2 + s[i] - '0';
    if (num[x] != 0)
      num[x]++;
    else {
      num[x] = 1;
      a[++tot] = x;
    }
  }
  for (int i = 0; i <= (1 << n) - 1; i++) gl[i] = i ^ (i >> 1);
  for (int i = 1; i <= (1 << n) - 1; i++)
    for (int j = 0; j < n; j++)
      if (((gl[i - 1] >> j) & 1) != ((gl[i] >> j) & 1)) {
        p[i] = j;
        break;
      }
  for (int i = 0; i <= (1 << n) - 1; i++) {
    f[i][0] = Js(i, 0);
    for (int j = 1; j <= (1 << n) - 1; j++) {
      if (((gl[j] >> p[j]) & 1) == ((i >> p[j]) & 1))
        f[i][gl[j]] = f[i][gl[j - 1]] + w[n - p[j]];
      else
        f[i][gl[j]] = f[i][gl[j - 1]] - w[n - p[j]];
    }
  }
  for (int i = 1; i <= q; i++) {
    int x = 0;
    scanf("%s %d", s + 1, &que[i].t);
    for (int i = 1; i <= n; i++) x = x * 2 + s[i] - '0';
    que[i].x = x;
    que[i].num = i;
  }
  sort(que + 1, que + 1 + q, cmp);
  for (int i = 1; i <= q; i++) {
    if (i == 1 || que[i].x != que[i - 1].x) {
      int x = que[i].x;
      memset(numm, 0, sizeof(numm));
      for (int j = 1; j <= tot; j++)
        if (f[min(x, a[j])][max(x, a[j])] <= 100)
          numm[f[min(x, a[j])][max(x, a[j])]] += num[a[j]];
      for (int j = 1; j <= 100; j++) numm[j] += numm[j - 1];
    }
    ans[que[i].num] = numm[que[i].t];
  }
  for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
}
