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