no tags 

       Mr. Bean’s uncle gifted him 15 English letter toys from 'a' to 'o'. As Mr. Bean is a joker, no one was willing to play with him. So he sat on the floor and arranged these toys in ascending order i.e. “abcdefghijklmno”. Then he figured out the next greatest word in lexicographic order that can be formed by rearranging the toys is “abcdefghijklmon”. Now he is learning programming and wants to write a program to solve the following problem: Given all the words that can be formed by rearranging letters form the given word S, find the N-th greater word in lexicographic order. You can safely assume that such a word always exists.

Input Specification:

The first line contains a natural number T denoting the number of test cases. Next T lines contain the description of T test cases, each with string S and value N.

Output Specification:

For each test case print the answer in a separate line.

Input Constraints:





All letters in S are unique.


Sample Input:


abdc 2

adcb 3

badc 7

Sample Output:




hide comments
Francky: 2013-12-17 12:57:29

@Runtime error : description says "You can safely assume that such a word always exists.", so you should be able to determine by yourself the maximum n. I think it's part of the problem.

Runtime Error: 2013-12-17 12:57:29

how big is n?

Added by:cegprakash
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64