SPOJ PERMUT1

#define ll long long
#include <bits/stdc++.h>
using namespace std;

const int OO = 1e9;
const double EPS = 1e-9;

ll n,k,mem[(1 << 12)][100];

ll solve(bitset<12> msk, int inv) {
    //cout << "here at msk = " << msk.to_ullong() << " inv = " << inv << "\n";
    int idx = msk.count();
    if(idx == n) {
        return (inv == k);
    }
    if(mem[msk.to_ullong()][inv] != -1) {
        return mem[msk.to_ullong()][inv];
    }
    ll &ret = mem[msk.to_ullong()][inv];
    ret = 0;
    int pre[12];
    for(int i = 0; i < n; i++) {
        pre[i] = msk[i] + (i > 0 ? pre[i-1]:0);
    }
    for(int i = 0; i < n; i++) {
        if(!msk[i]) {
            bitset<12> cp = msk;
            cp[i] = 1;
            ret += solve(cp,min(99,pre[n-1]-pre[i]+inv));
        }
    }
    return ret;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int d;
    cin >> d;
    while(d--) {
        cin >> n >> k;
        for(int i = (1 << 12)-1; i >= 0; i--) {
            for(int j = 0; j < 100; j++) {
                mem[i][j] = -1;
            }
        }
        cout << solve(bitset<12>(),0) << "\n";
    }
    return 0;
}