C

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

int main() {
    int t;
    cin>>t;

    long long int MAXN = 1e6;
    long long int factorial[1000001];
    long long int mod = 1000000007;

    factorial[0] = 1;
    for (int i = 1; i <= MAXN; i++)
        factorial[i] = factorial[i - 1] * i % mod;

    while(t--)
    {
        long long int n;
        cin >> n;

        for (long long int i = 1; i <= n; i++)
        {
            long long int tmp = n / i;
            long long int rem = n % i;
            long long int ans = (factorial[tmp] * factorial[n - tmp]) % mod;
            ans = (ans * (i - rem)) % mod;
            cout << ans << " ";
        }

        cout << "\n";
    }
}