#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long ll; template inline void amin(T &x, U y) { if(y < x) x = y; } template inline void amax(T &x, U y) { if(x < y) x = y; } template struct ModInt { static const int Mod = MOD; unsigned x; ModInt(): x(0) { } ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; } ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } }; typedef ModInt<1000000007> mint; void precomp(int N) { vector > dp, ndp(N+3, vector(N+3)); vector ans(N+1); ans[0] = 1; ndp[0][0] = 1; rep(i, N) { dp.swap(ndp); ndp.assign(N+3, vector(N+3)); int g = min(N, 2*i); rer(j, 0, g) rer(k, 0, g) { mint x = dp[j][k]; if(x.get() == 0) continue; //夫婦が同じグループに入る if(k > 0) ndp[j+1][k-1] += x * k; //夫婦なしグループを解消する場合 if(j > 0) ndp[j][k] += x * j; //夫婦ありグループに入る場合 ndp[j+1][k] += x; //新たなグループを作る場合 //新たなグループ, 新たなグループ ndp[j][k+2] += x; //新たなグループ, 既存のグループ if(j + k > 0) ndp[j][k+1] += x * (j + k) * 2; //既存のグループ, 既存のグループ if(j + k > 1) ndp[j][k] += x * ((j + k) * (j + k - 1)); } rer(j, 0, N) ans[i+1] += ndp[j][0]; } rer(i, 0, N) { if(i % 8 == 0) cout << endl << '\t'; else cout << " "; cout<