1. V = []
  2. for r in range(501):
  3. for b in range(501):
  4. red_cost = (b + 1) * ((1 + r) / 2) * r
  5. blue_cost = (r + 1) * ((1 + b) / 2) * b
  6. if red_cost <= 500 and blue_cost <= 500:
  7. V += [(r, b)]
  9. M = [[0] * 501 for n in range(501)]
  10. for R, B in V:
  11. for r in range(500 - R, -1, -1):
  12. for b in range(500 - B, r - 1, -1):
  13. if M[r][b] >= M[r + R][b + B]:
  14. v = M[r][b] + 1
  15. M[r + R][b + B] = v
  16. M[b + B][r + R] = v
  18. T = int(input())
  19. for _case in range(1, T + 1):
  20. R, B = map(int, input().split())
  21. answer = M[R][B] - 1
  22. print('Case #%i:' % _case, answer)