#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>

typedef long long ll;

inline int read() {
    static char ch;
    while ((ch = getchar()) < '0' || ch > '9')
        continue;
    int res = ch - 48;
    while ((ch = getchar()) >= '0' && ch <= '9')
        res = res * 10 + ch - 48;
    return res;
}

const int N = 500 + 5, M = 125000;
const int mod = 1e9 + 7;
int T, n, E, fac[N], inv[N];
int f[N][M];

inline int fpm(int x, int Exp) {
    int res = 1;
    for (; Exp > 0; Exp >>= 1, x = (ll)x * x % mod)
        if (Exp & 1) res = (ll)res * x % mod;
    return res;
}

inline void add(int &x, const int &y) {
    x += y;
    if (x >= mod) x -= mod;
}

inline void sub(int &x, const int &y) {
    x -= y;
    if (x < 0) x += mod;
}

void preprocess() {
    f[1][0] = f[1][1] = 1;
    for (int i = 2; i <= 500; ++i) {
        int k = i * (i - 1) / 2;
        for (int j = 0; j <= k; ++j) {
            f[i][j] = f[i - 1][j];
            if (j - i >= 0) sub(f[i][j], f[i - 1][j - i]);
            if (j > 0) add(f[i][j], f[i][j - 1]);
        }
        
        int k1 = i * (i + 1) / 2;
        for (int j = k + 1; j <= k1; ++j)
            f[i][j] = f[i][j - 1];
    }
    
    fac[0] = fac[1] = 1;
    inv[0] = inv[1] = 1;
    for (int i = 2; i <= 500; ++i) {
        fac[i] = (ll)fac[i - 1] * i % mod;
        inv[i] = fpm(fac[i], mod - 2);
    }
}

int main() {
    freopen("perm.in", "r", stdin);
    freopen("perm.out", "w", stdout);
    preprocess();
    for (T = read(); T--; ) {
        n = read(), E = read();
        
        int ans = 0;
        for (int i = 1; i <= n; ++i) {
            int j = std::min(E, i * (i - 1) / 2);
            int now1 = (ll)(n - i + 1) * f[i][j] % mod;
            int now2 = (ll)fac[n] * inv[i] % mod;
            now1 = (ll)now1 * now2 % mod * now2 % mod;
            add(ans, now1);
        }
        printf("%d\n", ans);
    }
    return 0;
}