1777B - Emordnilap - CodeForces Solution

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define op1(x,y) cout<<"Case #"<<x<<": "<<y<<endl
#define lb(a,val) lower_bound(a.begin(),a.end(),val)
#define ub(a,val) upper_bound(a.begin(),a.end(),val)
#define mem(a,b) memset(a,b,sizeof(a))
#define rf(m,a) for(ll i=m;i>=a;i--)
#define ftt ll t;cin>>t;while(t--)
#define f(k,m) for(ll i=k;i<m;i++)
#define INF 9223372036854775807
#define dbg cout<<"hii"<<endl;
#define ya cout<<"YES"<<endl
#define na cout<<"NO"<<endl
#define op(n) cout<<n<<endl;
#define ll long long int
#define nl cout<<endl;
#define MAXN 20000000
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define sp <<" "<<
#define ss second
#define ff first

void foo(ll fact[])
{
    fact[0]=1;
    fact[1]=1;
    for(ll i=2;i<100001;i++)
    {
        fact[i] = fact[i-1]*i;
        fact[i]%=mod;
    }

}


int main()
{
    ll fact[100001];
    ll n,ans;
    foo(fact);
    ll t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        ans = fact[n];
        ans*=n;
        ans%=mod;
        ans*=(n-1);
        ans%=mod;
        cout<<ans;nl;
    }
    return 0;
}