Codeforces Round #502 D

 The Wu

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 SS of mm "01-strings".

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

Note that the multiset SS can contain equal elements.

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

Mrs. Kasoura and Mr. Kasoura think that if si=tisi=ti (1≤i≤n1≤i≤n) then the "Wu" value of the character pair equals to wiwi, otherwise 00. 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 nn.

For example, if w=[4,5,3,6]w=[4,5,3,6], "Wu" of ("1001", "1100") is 77 because these strings have equal characters only on the first and third positions, so w1+w3=4+3=7w1+w3=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 SS such that the "Wu" value of the pair is not greater than kk.

Input

The first line contains three integers nn, mm, and qq (1≤n≤121≤n≤12, 1≤q,m≤5⋅1051≤q,m≤5⋅105) — the length of the "01-strings", the size of the multiset SS, and the number of queries.

The second line contains nn integers w1,w2,…,wnw1,w2,…,wn (0≤wi≤1000≤wi≤100) — the value of the ii-th caracter.

Each of the next mm lines contains the "01-string" ss of length nn — the string in the multiset SS.

Each of the next qq lines contains the "01-string" tt of length nn and integer kk (0≤k≤1000≤k≤100) — the query.

Output

For each query, print the answer for this query.

Examples

input

Copy

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

output

Copy

2
4
2
3
4

input

Copy

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

output

Copy

1
2
1
2

思路：预处理出1<<12相互匹配的权值，做个前缀和便于查询.

代码：

#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6+5;
const double eps = 1e-12;
const int inf = 0x3f3f3f3f;
map<int,int>::iterator it;

int n,m,q;
int a[7891];
int v[15];
int mp[7894][123];

int get_num(char s[])
{
	int tmp = 0;
		
	for(int j = n-1;j>= 0;j--)
	{
		if(s[j] == '1')
			tmp|= (1<<(n-1-j));
	}
	return tmp;
}

void solve()
{
	for(int i = 0;i< 1<<n;i++)
	{
		for(int j = 0;j< 1<<n;j++)
		{
			if(!a[j]) continue;
			
			int sum = 0;
			for(int k = 0;k< n;k++)
			{
				if((i&(1<<k)) == (j&(1<<k))) sum+= v[n-k];
			}
			
			if(sum> 100) continue;
			mp[i][sum]+= a[j];
		}
	}
}

int main()
{
	cin>>n>>m>>q;
	for(int i = 1;i<= n;i++)
		scanf("%d",&v[i]); 
	
	for(int i = 1;i<= m;i++)
	{
		char s[15];
		int tmp = 0;
		scanf(" %s",s);
		tmp = get_num(s);
		a[tmp]++;
	}
	
	solve();
	
	for(int i = 0;i< 1<<n;i++)
		for(int j = 1;j<= 100;j++)
			mp[i][j]+= mp[i][j-1];
	
	while(q--)
	{
		char s[15];
		int w;
		
		scanf(" %s %d",s,&w);
		
		int tmp = get_num(s);
		
		printf("%d\n",mp[tmp][w]);
	}
	
	return 0;
}