def f(n, m): dp = [[0] * (m + 1) for _ in range(n + 1)] dp[0][0] = 1 for i in range(1, n + 1): for j in range(m + 1): dp[i][j] = dp[i - 1][j] if j >= 1: dp[i][j] += dp[i - 1][j - 1] if j >= 2: dp[i][j] += dp[i - 1][j - 2] if j >= 5: dp[i][j] += dp[i - 1][j - 5] return dp[n][m] T = int(input()) for _ in range(T): n, m = map(int, input().split()) print(f(n, m))