The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors.

Suppose that we wish to know which stories in a 36-story building are safe to drop eggs from, and which will cause the eggs to break on landing. We make a few assumptions:

…..An egg that survives a fall can be used again.

…..A broken egg must be discarded.

…..The effect of a fall is the same for all eggs.

…..If an egg breaks when dropped, then it would break if dropped from a higher floor.

…..If an egg survives a fall then it would survive a shorter fall.

…..It is not ruled out that the first-floor windows break eggs, nor is it ruled out that the 36th-floor do not cause an egg to break.

In this problem you have to find minimum trials to solve for n eggs and k floors.

For more description on this problem see wiki page

**Input:**

The first line contains an integer T, depicting total number of test cases.

Then following T lines contains 2 integers n and k.

**Output:**

Print the minimum trials required to solve the problem.

**Constraints:**

1<=T<=30

1<=n<=10

1<=k<=50

**Example:**

Input:

1

2 10

Output:

4

Ibrahim Nash | 119 |

Ryan Yang | 87 |

Robin Kendrick | 83 |

aristotle | 79 |

bz24244 | 79 |

Lam Ngoc Pham | 476 |

All Is Well | 399 |

Prateek Gole | 385 |

Divvya Sinha | 374 |

Ibrahim Nash | 359 |

akhayrutdinov | 3873 |

sanjay05 | 3366 |

Michael Riegger | 2035 |

Jasleen Kaur 2 | 2012 |

Quandray | 1982 |