#include <functional>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <sstream>
#include <numeric>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
#define np(v) next_permutation(v.begin(), v.end())
#define pll pair < long long, long long>
#define all(a) a.begin(), a.end()
#define ull unsigned long long
#define pii pair < int, int >
#define sz(a) (int)a.size()
#define sqr(x) ((x) * (x))
#define y1 stupid_cmath
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define ll long long
#define f first
#define s second

const int inf = (int)1e9;
const int mod = inf + 9;
const int N = (int)1e6;
const double eps = 1e-9;
const double pi = acos(-1.0);

int n, m;
ll dp[6000][6000];

void solve(){
    cin >> n >> m;

    if(n >= 8000 || m > n * 6){
        cout << 0 << endl;
    }else{
        for(int i = 1; i <= n; ++i){
            for(int j = 1; j <= m; ++j){
                dp[i][j] = 0;
            }
        }
        dp[1][1] = 1;
        dp[1][2] = 1;
        dp[1][3] = 1;
        dp[1][4] = 1;
        dp[1][5] = 1;
        dp[1][6] = 1;
        for(int i = 2; i <= n; ++i){
            for(int j = i; j <= 6 * n; ++j){
                dp[i][j] = dp[i - 1][j - 1];
                if(j>2)
                    dp[i][j]+=dp[i-1][j-2];
                if(j>3)
                    dp[i][j]+=dp[i-1][j-3];
                if(j>4)
                    dp[i][j]+=dp[i-1][j-4];
                if(j>5)
                    dp[i][j]+=dp[i-1][j-5];
                if(j>6)
                    dp[i][j]+=dp[i-1][j-6];
            }
        }
        double p = dp[n][m];
        for(int i = 1; i <= n; ++i){
            p /= 6.0;
        }
        int ans = p * 100;
        cout << ans << endl;
    }

}


int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    for(int t = 1; t <= T; ++t){
//        cout << "Case " << t << ": ";
        solve();
    }
}