杜教BM

#include <algorithm>
#include  <iterator>
#include  <iostream>
#include   <cstring>
#include   <iomanip>
#include   <cstdlib>
#include    <cstdio>
#include    <string>
#include    <vector>
#include    <bitset>
#include    <cctype>
#include     <queue>
#include     <cmath>
#include      <list>
#include       <map>
#include       <set>
#include <assert.h>
//#include <unordered_map>
//#include <unordered_set>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/hash_policy.hpp>
using namespace std;
//#pragma GCC optimize(3)
//#pragma comment(linker, "/STACK:102400000,102400000")  //c++
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define pb push_back
#define pq priority_queue

typedef long long ll;
typedef unsigned long long ull;

typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int ,pii> p3;
//priority_queue<int> q;//这是一个大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q
//__gnu_pbds::cc_hash_table<int,int>ret[11];    //这是很快的hash_map
#define fi first
#define se second
//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)
#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行
#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)
//priority_queue<int ,vector<int>, greater<int> >que;

const ll nmos = 0x80000000LL;  //-2147483648
const int inf = 0x3f3f3f3f;

;
const double PI=acos(-1.0);

template<typename T>
inline T read(T&x){
    x=;;char ch=getchar();
    ') f|=(ch=='-'),ch=getchar();
    +ch-',ch=getchar();
    return x=f?-x:x;
}

/*-----------------------showtime----------------------*/
namespace linear_seq {
    ;
    #define rep(i,a,n) for (int i=a;i<n;i++)
    #define per(i,a,n) for (int i=n-1;i>=a;i--)
    #define mp make_pair
    #define all(x) (x).begin(),(x).end()
    #define SZ(x) ((int)(x).size())
    typedef vector<ll> VI;
    typedef pair<ll,ll> PII;
    ll powmod(ll a,ll b) {ll res=;a%=mod; assert(b>=); ){)res=res*a%mod;a=a*a%mod;}return res;}
    ll res[N],base[N],_c[N],_md[N];
    vector<ll> Md;
    void mul(ll *a,ll *b,int k) {
        rep(i,,k+k) _c[i]=;
        rep(i,,k) ,k) _c[i+j]=(_c[i+j]+a[i]*b[j])%mod;
        ;i>=k;i--) if (_c[i])
            rep(j,,SZ(Md)) _c[i-k+Md[j]]=(_c[i-k+Md[j]]-_c[i]*_md[Md[j]])%mod;
        rep(i,,k) a[i]=_c[i];
    }
    ll solve(ll n,VI a,VI b) { // a 系数 b 初值 b[n+1]=a[0]*b[n]+...
//        printf("%d\n",SZ(b));
        ll ans=,pnt=;
        int k=SZ(a);
        assert(SZ(a)==SZ(b));
        rep(i,,k) _md[k--i]=-a[i];_md[k]=;
        Md.clear();
        rep(i,,k) ) Md.push_back(i);
        rep(i,,k) res[i]=;
        res[]=;
        while ((1ll<<pnt)<=n) pnt++;
        ;p--) {
            mul(res,res,k);
            ) {
                ;i>=;i--) res[i+]=res[i];res[]=;
                rep(j,,SZ(Md)) res[Md[j]]=(res[Md[j]]-res[k]*_md[Md[j]])%mod;
            }
        }
        rep(i,,k) ans=(ans+res[i]*b[i])%mod;
        ) ans+=mod;
        return ans;
    }
    VI BM(VI s) {
        VI C(,),B(,);
        ,m=,b=;
        rep(n,,SZ(s)) {
            ll d=;
            rep(i,,L+) d=(d+(ll)C[i]*s[n-i])%mod;
            ) ++m;
            *L<=n) {
                VI T=C;
                ll c=mod-d*powmod(b,mod-)%mod;
                );
                rep(i,,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
                L=n+-L; B=T; b=d; m=;
            } else {
                ll c=mod-d*powmod(b,mod-)%mod;
                );
                rep(i,,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
                ++m;
            }
        }
        return C;
    }
    ll gao(VI a,ll n) {
        VI c=BM(a);
        c.erase(c.begin());
        rep(i,,SZ(c)) c[i]=(mod-c[i])%mod;
        return solve(n,c,VI(a.begin(),a.begin()+SZ(c)));
    }
};
            vector<ll>q;
int main()
{
    int T; cin>>T;
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    q.push_back();
    while(T--)
    {
        ll  n; cin>>n;
        printf());
    }
}