#include using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; typedef unsigned long long ull; static const long long mod = 1000000007; struct mint { long long x; mint(ll x = 0):x(x%mod) {} //mint(ll x = 0):x((x%mod+mod)%mod) {} // for minus mint& operator+=(const mint a) { (x += a.x) %= mod; return *this; } mint& operator-=(const mint a) { (x += mod-a.x) %= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint ret(*this); return ret += a; } mint operator-(const mint a) const { mint ret(*this); return ret -= a; } mint operator*(const mint a) const { mint ret(*this); return ret *= a; } mint pow(ll t) const { if(t==0) return mint(1); mint a = pow(t>>1); a *= a; if(t&1) a *= *this; return a; } //for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint ret(*this); return ret /= a; } }; ostream &operator<<(ostream& os, const mint& x) { os << x.x; return os; } bool operator==(const mint& a, const mint& b){ return a.x == b.x; } class modutils { vector fact, invfact; public: modutils(int n = 2000005):fact(n+1),invfact(n+1) { fact[0] = 1; for(int i=1; i<=n; i++) fact[i] = fact[i-1] * i; invfact[n] = fact[n].inv(); for(int i=n; i>=1; i--) invfact[i-1] = invfact[i] * i; } mint pow(mint x, ll n) { return x.pow(n); } mint comb(ll n, ll k) { if(n<0 || k<0 || n> N >> M >> X; mint ret(0); if(X%2 == 0){ ret += (mint(1-M+mod).pow(N) + mint(M+1).pow(N))/2; }else{ ret += (mint(M+1).pow(N) - mint(1-M+mod).pow(N))/2; } cout << ret << endl; } int main(){ int S; cin >> S; rep(i,S){ solve(); } return 0; }