#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
int iinf = 1 << 30;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int main() {
  int n, m, q;
  scanf("%d %d %d", &n, &m, &q);
  int sco[n];
  for (int i = 0; i < n; i++) scanf("%d", &sco[i]);
  string w[m];
  int cnt[1 << n];
  fill(cnt, cnt + (1 << n), 0);
  for (int i = 0; i < m; i++) {
    cin >> w[i];
    int y = 0;
    for (int j = 0; j < n; j++) {
      if (w[i][j] == '1') y += 1 << (n - j - 1);
    }
    cnt[y]++;
  }
  int summ[1 << n];
  for (int i = 0; i < 1 << n; i++) {
    summ[i] = 0;
    for (int j = 0; j < n; j++) {
      if ((i >> j) & 1) summ[i] += sco[n - j - 1];
    }
  }
  int wa = 0;
  for (int j = 0; j < n; j++) wa += sco[j];
  vector<pair<int, int> > v;
  for (int j = 0; j < 1 << n; j++) {
    v.push_back({wa - summ[j], j});
  }
  sort(v.begin(), v.end());
  int ans[q];
  vector<pair<int, int> > vv[1 << n];
  int k[q];
  for (int i = 0; i < q; i++) {
    char s[n];
    scanf("%s", s);
    scanf("%d", &k[i]);
    int y = 0;
    for (int j = 0; j < n; j++) {
      if (s[j] == '1') y += 1 << (n - j - 1);
    }
    vv[y].push_back({k[i], i});
  }
  for (int i = 0; i < 1 << n; i++) sort(vv[i].begin(), vv[i].end());
  for (int i = 0; i < 1 << n; i++) {
    int now = 0;
    int sum = 0;
    for (int j = 0; j < 1 << n; j++) {
      if (now == vv[i].size()) break;
      while (now < vv[i].size() && vv[i][now].first < v[j].first) {
        ans[vv[i][now].second] = sum;
        now++;
      }
      sum += cnt[v[j].second ^ i];
    }
    for (int j = now; j < vv[i].size(); j++) ans[vv[i][j].second] = m;
  }
  for (int i = 0; i < q; i++) {
    printf("%d\n", ans[i]);
  }
}
