K-Pangrams
Submissions: 6276   Accuracy:

27.71%

  Difficulty: Easy   Marks: 2

Given a String S and an integer k we need to find that whether the string can be changed into Pangram string by performing at most k changes and that changes can be only modification in a string (ie In one change we can remove existing character and add new character).

Input
first line of input contains of an integer 'T' denoting number od test cases
first line of each testcase contains String 'S'.
second line of each testcase contains an integer 'k' denoting the number of changes that are allowed. 


Output
for each case in a new line print 1 for Yes and  0 for No .

Constraints
1<=T<=40
1<=S.length()<=10^6
0<=k<=10^9

Example

Input

2
qwqqwqeqqwdsdadsdasadsfsdsdsdasasas
4
qwqqwqeqqwdsdadsdasadsfsdsdsdasasas
24


Output
0
1

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Hardik Gulati
Author: hardikgulati96


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.