egg_dropping_puzzle

#code
INT_MAX = 32767
def eggDrop(n, k): 
    # A 2D table where entery eggFloor[i][j] will represent minimum 
    # number of trials needed for i eggs and j floors. 
    eggFloor = [[0 for x in range(k + 1)] for x in range(n + 1)] 
  
    # We need one trial for one floor and0 trials for 0 floors 
    for i in range(1, n + 1): 
        eggFloor[i][1] = 1
        eggFloor[i][0] = 0
  
    # We always need j trials for one egg and j floors. 
    for j in range(1, k + 1): 
        eggFloor[1][j] = j 
  
    # Fill rest of the entries in table using optimal substructure 
    # property 
    for i in range(2, n + 1): 
        for j in range(2, k + 1): 
            eggFloor[i][j] = INT_MAX 
            for x in range(1, j + 1): 
                res = 1 + max(eggFloor[i-1][x-1], eggFloor[i][j-x]) 
                if res < eggFloor[i][j]: 
                    eggFloor[i][j] = res 
  
    # eggFloor[n][k] holds the result 
    return eggFloor[n][k] 
for _ in range(int(input())):
    n,k=input().split()
    n=int(n)
    k=int(k)
    print(eggDrop(n, k))