#include <iostream> #include <vector> using namespace std; int countCombinations(int n, int m) { vector<int> coins = {1, 2, 5}; vector<vector<int>> dp(n+1, vector<int>(m+1, 0)); dp[0][0] = 1; for (int i = 0; i <= n; i++) { dp[i][0] = 1; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] = dp[i-1][j]; if (j >= coins[i-1]) { dp[i][j] += dp[i][j-coins[i-1]]; } } } return dp[n][m]; } int main() { int T; cin >> T; while (T--) { int n, m; cin >> n >> m; cout << countCombinations(n, m) << endl; } return 0; }