Jack claims that he has telekinetic powers. He has bet Mike that he can throw a die n times and make the pips add up to exactly k. Jack's die is a perfectly symmetric cube with the numbers 1 through 6 on its faces. Mike does not believe in telekinesis, but he is worried that Jack might win the bet by pure luck. He therefore wants to know the chance (as a percentage) of such an unlucky event, and asks you to write a program that computes it.
In other words, throw a fair die n times and find, as a percentage, the probability that the pips add up to exactly k.
The first line contains a single integer t (1≤t≤20), the number of test cases. Each of the next t lines contains two integers n and k (1≤n,k≤106) separated by a single space, where n is the number of throws and k is the target sum of pips.
For each test case, print on its own line the probability (as a percentage) that Jack wins the bet, rounded down to the nearest integer. That is, print the integer part of 100 times the probability that n throws of a fair die sum to exactly k.