from heapq import heappop
t = int(input())
for  i in range(t):
  x,a = map(int,input().split())
  INF = 10**18
  dp = [INF]*(a+1)
  dp[0] = 0
  ks = []
  border = int(x**0.5)+1
  for i in range(border-10, border+10):
    if i <= 0: continue
    ks.append([i,i*i+x])
  for i in range(1,a+1):
    dp[i] = i*i+x
    for j,jc in ks:
      if j > i: break
      dp[i] = min(dp[i], dp[i-j]+ jc)
  print(dp[-1])