D. Good Substrings（双模数哈希)

https://codeforces.com/problemset/problem/271/D

You've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad.

A substring s[l...r] (1 ≤ l ≤ r ≤ |s|) of string s  =  s 1 s 2...s |s| (where |s| is the length of string s) is string  s l s l + 1...s r.

The substring s[l...r] is good, if among the letters  s l, s l + 1, ..., s r there are at most k bad ones (look at the sample's explanation to understand it more clear).

Your task is to find the number of distinct good substrings of the given string s. Two substrings s[x...y] and s[p...q] are considered distinct if their content is different, i.e. s[x...y] ≠ s[p...q].

Input

The first line of the input is the non-empty string s, consisting of small English letters, the string's length is at most 1500 characters.

The second line of the input is the string of characters "0" and "1", the length is exactly 26 characters. If the i-th character of this string equals "1", then the i-th English letter is good, otherwise it's bad. That is, the first character of this string corresponds to letter "a", the second one corresponds to letter "b" and so on.

The third line of the input consists a single integer k (0 ≤ k ≤ |s|) — the maximum acceptable number of bad characters in a good substring.

Output

Print a single integer — the number of distinct good substrings of string s.

Examples

input

Copy

ababab
01000000000000000000000000
1

output

Copy

5

input

Copy

acbacbacaa
00000000000000000000000000
2

output

Copy

8

Note

In the first example there are following good substrings: "a", "ab", "b", "ba", "bab".

In the second example there are following good substrings: "a", "aa", "ac", "b", "ba", "c", "ca", "cb".

---

 

看了下别人好像是字典树过的。感觉这题其实可以暴力，就是哈希一下，然后放set，1996ms跑过去了。注意单哈希好像卡掉了。换成双哈希就好啦。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
const int maxn=1505;
const int P=131;
const int mod1=19260817;
const int mod2=19660813;
char str[maxn];
bool isgood[30];
char p[30]={"#abcdefghijklmnopqrstuvwxyz"};
char ks[30];
ull f1[maxn],f2[maxn];
int main(void)
{
  //cin.tie(0);std::ios::sync_with_stdio(false);
  cin>>str+1;
  LL n=strlen(str+1);
//  for(LL i=1;i<=n;i++){
//  	f1[i]=(f1[i-1]*P+(ull)(str[i]-'a'+1))%mod1;
//  	f2[i]=(f2[i-1]*P+(ull)(str[i]-'a'+1))%mod2;
//  } 
  cin>>ks+1;
  
  LL k;cin>>k;
  
  for(LL i=1;i<=26;i++){
  	if(ks[i]=='1') isgood[i]=true;
  }
  
  set< pair<LL,LL> >st;
  set< pair<LL,LL> >::iterator it;
  for(LL i=1;i<=n;i++){
  	LL cnt=0;LL now1=0;LL now2=0;
  	for(LL j=i;j<=n;j++){
  		if(isgood[str[j]-'a'+1]==false) cnt++;
	    now1=(now1*P+(str[j]-'a'+1))%mod1;
	    now2=(now2*P+(str[j]-'a'+1))%mod2;
		if(cnt<=k){
			if(st.find({now1,now2})==st.end()){
				st.insert({now1,now2});	    
			}
	    }
		if(cnt>k) break;
	}
  }
  cout<<st.size()<<endl;
return 0;
}