#include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<map>

 #include<set>

 #include<queue>

 #include<vector>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef vector<int> VI;

 #define fi first

 #define se second

 #define MP make_pair

 #define N   1100000

 #define MOD 1000000007

 #define eps 1e-8

 #define pi acos(-1)

 int f[],g[][],a[N],b[N],c[N],flag[N];

 char ch[],x[];

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 void swap(int &x,int &y)

 {

     int t=x;x=y;y=t;

 }

 int main()

 {

 //    freopen("1.in","r",stdin);

     //freopen("1.out","w",stdout);

     int n,m,q;

     scanf("%d%d%d",&n,&m,&q);

     int max=(<<n)-;

     for(int i=;i<=n;i++) scanf("%d",&a[i]);

     for(int i=;i<=m;i++)

     {

         scanf("%s",ch);

         int now=;

         int x=;

         for(int j=n-;j>=;j--)

         {

             if(ch[j]=='') x+=now;

             now<<=;

         }

         flag[x]++;

     }

        m=;

     for(int i=;i<=max;i++)

      if(flag[i]){b[++m]=i; c[m]=flag[i];}

     for(int i=;i<=max;i++)

      for(int j=;j<=n;j++)

       if(i&(<<(j-))) f[i]+=a[n-j+];

     for(int i=;i<=(<<n);i++)

      for(int j=;j<=m;j++)

      {

          int t=f[(i^b[j])^max];

          if(t<=) g[i][t]+=c[j];

      }

     for(int i=;i<=(<<n);i++)

      for(int j=;j<=;j++) g[i][j]+=g[i][j-];

     for(int i=;i<=q;i++)

     {

         int y;

         scanf("%s%d",x,&y);

         int now=;

         int t=;

         for(int j=n-;j>=;j--)

         {

             if(x[j]=='') t+=now;

             now<<=;

         }

         y=min(y,);

         printf("%d\n",g[t][y]);

     }

     return ;

 }