結果
| 問題 | No.1720 Division Permutation |
| ユーザー |
 hotman78
|
| 提出日時 | 2022-01-02 20:35:21 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 543 ms / 4,000 ms |
| コード長 | 39,924 bytes |
| コンパイル時間 | 21,550 ms |
| コンパイル使用メモリ | 348,508 KB |
| 最終ジャッジ日時 | 2025-01-27 08:32:38 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 60 |
ソースコード
#line 2 "cpplib/util/template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("avx2")#include<bits/stdc++.h>using namespace std;struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}__INIT__;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define endl ('\n')typedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>using V=vector<T>;template<typename T>using VV=V<V<T>>;template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void debug(const T& t){#ifdef DEBUGfor(auto e=begin(t);e!=end(t);++e)cerr<<*e<<" ";cerr<<endl;#endif}template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#define _overload4(_1,_2,_3,_4,name,...) name#define __rep(i,a) repi(i,0,a,1)#define _rep(i,a,b) repi(i,a,b,1)#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)#define _overload3_rev(_1,_2,_3,name,...) name#define _rep_rev(i,a) repi_rev(i,0,a)#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)// #define rep(i,...) for(auto i:range(__VA_ARGS__))// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)// #define irep(i) for(lint i=0;;++i)// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}#define all(n) begin(n),end(n)template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}const string ds="DRUL";const vector<lint> dx={1,0,-1,0,1,1,-1,-1};const vector<lint> dy={0,1,0,-1,1,-1,1,-1};#define SUM(v) accumulate(all(v),0LL)#if __cplusplus>=201703Ltemplate<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);elsereturn vector(arg,make_vector<T>(x,args...));}#endif#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))#define bit(n,a) ((n>>a)&1)vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}using graph=vector<vector<int>>;template<typename T>using graph_w=vector<vector<pair<int,T>>>;template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}#if __cplusplus>=201703Lconstexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}#endiftemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}// 128*1024*1024#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ =(char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax,%%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);#line 2 "cpplib/math/ACL_modint998244353.hpp"#include <utility>namespace atcoder {namespace internal {// @param m `1 <= m`// @return x mod mconstexpr long long safe_mod(long long x, long long m) {x %= m;if (x < 0) x += m;return x;}// Fast modular multiplication by barrett reduction// Reference: https://en.wikipedia.org/wiki/Barrett_reduction// NOTE: reconsider after Ice Lakestruct barrett {unsigned int _m;unsigned long long im;// @param m `1 <= m < 2^31`barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}// @return munsigned int umod() const { return _m; }// @param a `0 <= a < m`// @param b `0 <= b < m`// @return `a * b % m`unsigned int mul(unsigned int a, unsigned int b) const {// [1] m = 1// a = b = im = 0, so okay// [2] m >= 2// im = ceil(2^64 / m)// -> im * m = 2^64 + r (0 <= r < m)// let z = a*b = c*m + d (0 <= c, d < m)// a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im// c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2// ((ab * im) >> 64) == c or c + 1unsigned long long z = a;z *= b;#ifdef _MSC_VERunsigned long long x;_umul128(z, im, &x);#elseunsigned long long x =(unsigned long long)(((unsigned __int128)(z)*im) >> 64);#endifunsigned int v = (unsigned int)(z - x * _m);if (_m <= v) v += _m;return v;}};// @param n `0 <= n`// @param m `1 <= m`// @return `(x ** n) % m`constexpr long long pow_mod_constexpr(long long x, long long n, int m) {if (m == 1) return 0;unsigned int _m = (unsigned int)(m);unsigned long long r = 1;unsigned long long y = safe_mod(x, m);while (n) {if (n & 1) r = (r * y) % _m;y = (y * y) % _m;n >>= 1;}return r;}// Reference:// M. Forisek and J. Jancina,// Fast Primality Testing for Integers That Fit into a Machine Word// @param n `0 <= n`constexpr bool is_prime_constexpr(int n) {if (n <= 1) return false;if (n == 2 || n == 7 || n == 61) return true;if (n % 2 == 0) return false;long long d = n - 1;while (d % 2 == 0) d /= 2;constexpr long long bases[3] = {2, 7, 61};for (long long a : bases) {long long t = d;long long y = pow_mod_constexpr(a, t, n);while (t != n - 1 && y != 1 && y != n - 1) {y = y * y % n;t <<= 1;}if (y != n - 1 && t % 2 == 0) {return false;}}return true;}template <int n> constexpr bool is_prime = is_prime_constexpr(n);// @param b `1 <= b`// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/gconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {a = safe_mod(a, b);if (a == 0) return {b, 0};// Contracts:// [1] s - m0 * a = 0 (mod b)// [2] t - m1 * a = 0 (mod b)// [3] s * |m1| + t * |m0| <= blong long s = b, t = a;long long m0 = 0, m1 = 1;while (t) {long long u = s / t;s -= t * u;m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b// [3]:// (s - t * u) * |m1| + t * |m0 - m1 * u|// <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)// = s * |m1| + t * |m0| <= bauto tmp = s;s = t;t = tmp;tmp = m0;m0 = m1;m1 = tmp;}// by [3]: |m0| <= b/g// by g != b: |m0| < b/gif (m0 < 0) m0 += b / s;return {s, m0};}// Compile time primitive root// @param m must be prime// @return primitive root (and minimum in now)constexpr int primitive_root_constexpr(int m) {if (m == 2) return 1;if (m == 167772161) return 3;if (m == 469762049) return 3;if (m == 754974721) return 11;if (m == 998244353) return 3;int divs[20] = {};divs[0] = 2;int cnt = 1;int x = (m - 1) / 2;while (x % 2 == 0) x /= 2;for (int i = 3; (long long)(i)*i <= x; i += 2) {if (x % i == 0) {divs[cnt++] = i;while (x % i == 0) {x /= i;}}}if (x > 1) {divs[cnt++] = x;}for (int g = 2;; g++) {bool ok = true;for (int i = 0; i < cnt; i++) {if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {ok = false;break;}}if (ok) return g;}}template <int m> constexpr int primitive_root = primitive_root_constexpr(m);} // namespace internal} // namespace atcoder#include <cassert>#include <numeric>#include <type_traits>namespace atcoder {namespace internal {#ifndef _MSC_VERtemplate <class T>using is_signed_int128 =typename std::conditional<std::is_same<T, __int128_t>::value ||std::is_same<T, __int128>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int128 =typename std::conditional<std::is_same<T, __uint128_t>::value ||std::is_same<T, unsigned __int128>::value,std::true_type,std::false_type>::type;template <class T>using make_unsigned_int128 =typename std::conditional<std::is_same<T, __int128_t>::value,__uint128_t,unsigned __int128>;template <class T>using is_integral = typename std::conditional<std::is_integral<T>::value ||is_signed_int128<T>::value ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_signed_int = typename std::conditional<(is_integral<T>::value &&std::is_signed<T>::value) ||is_signed_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<(is_integral<T>::value &&std::is_unsigned<T>::value) ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int128<T>::value,make_unsigned_int128<T>,typename std::conditional<std::is_signed<T>::value,std::make_unsigned<T>,std::common_type<T>>::type>::type;#elsetemplate <class T> using is_integral = typename std::is_integral<T>;template <class T>using is_signed_int =typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<is_integral<T>::value &&std::is_unsigned<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int<T>::value,std::make_unsigned<T>,std::common_type<T>>::type;#endiftemplate <class T>using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T>using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;} // namespace internal} // namespace atcoder#include <cassert>#include <numeric>#include <type_traits>#ifdef _MSC_VER#include <intrin.h>#endifnamespace atcoder {namespace internal {struct modint_base {};struct static_modint_base : modint_base {};template <class T> using is_modint = std::is_base_of<modint_base, T>;template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;} // namespace internaltemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>struct static_modint : internal::static_modint_base {using mint = static_modint;public:static constexpr int mod() { return m; }static mint raw(int v) {mint x;x._v = v;return x;}static_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>static_modint(T v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>static_modint(T v) {_v = (unsigned int)(v % umod());}static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}mint& operator*=(const mint& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {if (prime) {assert(_v);return pow(umod() - 2);} else {auto eg = internal::inv_gcd(_v, m);assert(eg.first == 1);return eg.second;}}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}private:unsigned int _v;static constexpr unsigned int umod() { return m; }static constexpr bool prime = internal::is_prime<m>;};template <int id> struct dynamic_modint : internal::modint_base {using mint = dynamic_modint;public:static int mod() { return (int)(bt.umod()); }static void set_mod(int m) {assert(1 <= m);bt = internal::barrett(m);}static mint raw(int v) {mint x;x._v = v;return x;}dynamic_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>dynamic_modint(T v) {long long x = (long long)(v % (long long)(mod()));if (x < 0) x += mod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>dynamic_modint(T v) {_v = (unsigned int)(v % mod());}dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v += mod() - rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator*=(const mint& rhs) {_v = bt.mul(_v, rhs._v);return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {auto eg = internal::inv_gcd(_v, mod());assert(eg.first == 1);return eg.second;}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}private:unsigned int _v;static internal::barrett bt;static unsigned int umod() { return bt.umod(); }};template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;using modint998244353 = static_modint<998244353>;using modint1000000007 = static_modint<1000000007>;using modint = dynamic_modint<-1>;namespace internal {template <class T>using is_static_modint = std::is_base_of<internal::static_modint_base, T>;template <class T>using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;template <class> struct is_dynamic_modint : public std::false_type {};template <int id>struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};template <class T>using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;} // namespace internal} // namespace atcoderusing mint=atcoder::modint998244353;#line 4 "cpplib/math/ACL_modint_base.hpp"std::ostream& operator<<(std::ostream& lhs, const mint& rhs) noexcept {lhs << rhs.val();return lhs;}std::istream& operator>>(std::istream& lhs,mint& rhs) noexcept {long long x;lhs >> x;rhs=x;return lhs;}int MOD_NOW=-1;int sz=0;std::vector<mint>fact_table,fact_inv_table;void update(int x){if(MOD_NOW!=mint::mod()||sz==0){fact_table.assign(1,1);fact_inv_table.assign(1,1);sz=1;MOD_NOW=mint::mod();}while(sz<=x){fact_table.resize(sz*2);fact_inv_table.resize(sz*2);for(int i=sz;i<sz*2;++i){fact_table[i]=fact_table[i-1]*i;}fact_inv_table[sz*2-1]=fact_table[sz*2-1].inv();for(int i=sz*2-2;i>=sz;--i){fact_inv_table[i]=fact_inv_table[i+1]*(i+1);}sz*=2;}}inline mint fact(int x){assert(x>=0);update(x);return fact_table[x];}inline mint fact_inv(int x){assert(x>=0);update(x);return fact_inv_table[x];}inline mint comb(int x,int y){if(x<0||x<y||y<0)return 0;return fact(x)*fact_inv(y)*fact_inv(x-y);}inline mint perm(int x,int y){return fact(x)*fact_inv(y);}inline mint multi_comb(int x,int y){return comb(x+y-1,y);}#line 1 "cpplib/data_structure/permutation_tree.hpp"#include <algorithm>#ifdef _MSC_VER#include <intrin.h>#endifnamespace atcoder {namespace internal {// @param n `0 <= n`// @return minimum non-negative `x` s.t. `n <= 2**x`int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}// @param n `1 <= n`// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`int bsf(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}} // namespace internal} // namespace atcoder#include <cassert>#include <iostream>#include <vector>namespace atcoder {template <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>struct lazy_segtree {public:lazy_segtree() : lazy_segtree(0) {}lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());lz = std::vector<F>(size, id());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return d[p];}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);if (l == r) return e();l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push(r >> i);}S sml = e(), smr = e();while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }void apply(int p, F f) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);d[p] = mapping(f, d[p]);for (int i = 1; i <= log; i++) update(p >> i);}void apply(int l, int r, F f) {assert(0 <= l && l <= r && r <= _n);if (l == r) return;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, f);if (r & 1) all_apply(--r, f);l >>= 1;r >>= 1;}l = l2;r = r2;}for (int i = 1; i <= log; i++) {if (((l >> i) << i) != l) update(l >> i);if (((r >> i) << i) != r) update((r - 1) >> i);}}template <bool (*g)(S)> int max_right(int l) {return max_right(l, [](S x) { return g(x); });}template <class G> int max_right(int l, G g) {assert(0 <= l && l <= _n);assert(g(e()));if (l == _n) return _n;l += size;for (int i = log; i >= 1; i--) push(l >> i);S sm = e();do {while (l % 2 == 0) l >>= 1;if (!g(op(sm, d[l]))) {while (l < size) {push(l);l = (2 * l);if (g(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*g)(S)> int min_left(int r) {return min_left(r, [](S x) { return g(x); });}template <class G> int min_left(int r, G g) {assert(0 <= r && r <= _n);assert(g(e()));if (r == 0) return 0;r += size;for (int i = log; i >= 1; i--) push((r - 1) >> i);S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!g(op(d[r], sm))) {while (r < size) {push(r);r = (2 * r + 1);if (g(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;std::vector<F> lz;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }void all_apply(int k, F f) {d[k] = mapping(f, d[k]);if (k < size) lz[k] = composition(f, lz[k]);}void push(int k) {all_apply(2 * k, lz[k]);all_apply(2 * k + 1, lz[k]);lz[k] = id();}};} // namespace atcoderusing namespace atcoder;namespace permutation_tree{template<typename T>T op(T x,T y){return max(x,y);}template<typename T>T e(){return -T(1<<30);}template<typename T,typename F>T mapping(F x,T y){return x+y;}template<typename F>F composition(F x,F y){return x+y;}template<typename F>F id(){return F();}template<typename T>struct perm_tree{struct node;using np=node*;struct node{//両方とも半開区間で保存int l,r;T mn,mx;bool is_join;std::vector<np>ch;node(){}node(int idx,T x):l(idx),r(idx+1),mn(x),mx(x+1),is_join(1){};};std::stack<int>mn_stk,mx_stk;std::vector<T>x;using F=T;lazy_segtree<T,op,e,F,mapping,composition,id>seg;stack<np>stk;perm_tree(const std::vector<T>&x):x(x),seg(x.size()){for(int i=0;i<(int)x.size();++i)insert(i);}np get(){assert((int)stk.size()==1);return stk.top();}void insert(int idx){{int r=idx;while(!mn_stk.empty()&&x[mn_stk.top()]>x[idx]){mn_stk.pop();int l=(mn_stk.empty()?0:mn_stk.top()+1);seg.apply(l,r,x[idx]-x[r-1]);r=l;}mn_stk.emplace(idx);}{int r=idx;while(!mx_stk.empty()&&x[mx_stk.top()]<x[idx]){mx_stk.pop();int l=(mx_stk.empty()?0:mx_stk.top()+1);seg.apply(l,r,-x[idx]+x[r-1]);r=l;}mx_stk.emplace(idx);}seg.apply(0,idx,1);np nw=new node(idx,x[idx]);while(1){if(!stk.empty()&&!stk.top()->ch.empty()&&stk.top()->is_join&&(nw->mn==stk.top()->ch.back()->mx||nw->mx==stk.top()->ch.back()->mn)){stk.top()->ch.emplace_back(nw);stk.top()->mx=max(stk.top()->mx,nw->mx);stk.top()->mn=min(stk.top()->mn,nw->mn);stk.top()->r=idx+1;nw=stk.top();stk.pop();continue;}if(!stk.empty()&&(stk.top()->mx==nw->mn||stk.top()->mn==nw->mx)){np nw2=new node();auto top=stk.top();stk.pop();nw2->is_join=1;nw2->l=top->l;nw2->r=nw->r;nw2->mn=min(top->mn,nw->mn);nw2->mx=max(top->mx,nw->mx);nw2->ch.emplace_back(top);nw2->ch.emplace_back(nw);nw=nw2;continue;}stk.emplace(nw);if((int)stk.size()==1)break;T mx=seg.prod(0,stk.top()->l);if(mx!=0)break;nw=new node();*nw=*stk.top();nw->is_join=0;nw->ch.clear();nw->ch.emplace_back(stk.top());stk.pop();while(1){auto top=stk.top();nw->ch.emplace_back(top);stk.pop();nw->l=min(nw->l,top->l);nw->r=max(nw->r,top->r);nw->mn=min(nw->mn,top->mn);nw->mx=max(nw->mx,top->mx);if(nw->r-nw->l==nw->mx-nw->mn){break;}}reverse(nw->ch.begin(),nw->ch.end());}seg.set(idx,T());}};};using namespace permutation_tree;#line 4 "main.cpp"#include <algorithm>#include <array>#include <cassert>#include <type_traits>#include <vector>namespace atcoder {namespace internal {template <class mint, internal::is_static_modint_t<mint>* = nullptr>void butterfly(std::vector<mint>& a) {static constexpr int g = internal::primitive_root<mint::mod()>;int n = int(a.size());int h = internal::ceil_pow2(n);static bool first = true;static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]if (first) {first = false;mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1int cnt2 = bsf(mint::mod() - 1);mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();for (int i = cnt2; i >= 2; i--) {// e^(2^i) == 1es[i - 2] = e;ies[i - 2] = ie;e *= e;ie *= ie;}mint now = 1;for (int i = 0; i <= cnt2 - 2; i++) {sum_e[i] = es[i] * now;now *= ies[i];}}for (int ph = 1; ph <= h; ph++) {int w = 1 << (ph - 1), p = 1 << (h - ph);mint now = 1;for (int s = 0; s < w; s++) {int offset = s << (h - ph + 1);for (int i = 0; i < p; i++) {auto l = a[i + offset];auto r = a[i + offset + p] * now;a[i + offset] = l + r;a[i + offset + p] = l - r;}now *= sum_e[bsf(~(unsigned int)(s))];}}}template <class mint, internal::is_static_modint_t<mint>* = nullptr>void butterfly_inv(std::vector<mint>& a) {static constexpr int g = internal::primitive_root<mint::mod()>;int n = int(a.size());int h = internal::ceil_pow2(n);static bool first = true;static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]if (first) {first = false;mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1int cnt2 = bsf(mint::mod() - 1);mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();for (int i = cnt2; i >= 2; i--) {// e^(2^i) == 1es[i - 2] = e;ies[i - 2] = ie;e *= e;ie *= ie;}mint now = 1;for (int i = 0; i <= cnt2 - 2; i++) {sum_ie[i] = ies[i] * now;now *= es[i];}}for (int ph = h; ph >= 1; ph--) {int w = 1 << (ph - 1), p = 1 << (h - ph);mint inow = 1;for (int s = 0; s < w; s++) {int offset = s << (h - ph + 1);for (int i = 0; i < p; i++) {auto l = a[i + offset];auto r = a[i + offset + p];a[i + offset] = l + r;a[i + offset + p] =(unsigned long long)(mint::mod() + l.val() - r.val()) *inow.val();}inow *= sum_ie[bsf(~(unsigned int)(s))];}}}} // namespace internaltemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>std::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};if (std::min(n, m) <= 60) {if (n < m) {std::swap(n, m);std::swap(a, b);}std::vector<mint> ans(n + m - 1);for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {ans[i + j] += a[i] * b[j];}}return ans;}int z = 1 << internal::ceil_pow2(n + m - 1);a.resize(z);internal::butterfly(a);b.resize(z);internal::butterfly(b);for (int i = 0; i < z; i++) {a[i] *= b[i];}internal::butterfly_inv(a);a.resize(n + m - 1);mint iz = mint(z).inv();for (int i = 0; i < n + m - 1; i++) a[i] *= iz;return a;}template <unsigned int mod = 998244353,class T,std::enable_if_t<internal::is_integral<T>::value>* = nullptr>std::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};using mint = static_modint<mod>;std::vector<mint> a2(n), b2(m);for (int i = 0; i < n; i++) {a2[i] = mint(a[i]);}for (int i = 0; i < m; i++) {b2[i] = mint(b[i]);}auto c2 = convolution(move(a2), move(b2));std::vector<T> c(n + m - 1);for (int i = 0; i < n + m - 1; i++) {c[i] = c2[i].val();}return c;}std::vector<long long> convolution_ll(const std::vector<long long>& a,const std::vector<long long>& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};static constexpr unsigned long long MOD1 = 754974721; // 2^24static constexpr unsigned long long MOD2 = 167772161; // 2^25static constexpr unsigned long long MOD3 = 469762049; // 2^26static constexpr unsigned long long M2M3 = MOD2 * MOD3;static constexpr unsigned long long M1M3 = MOD1 * MOD3;static constexpr unsigned long long M1M2 = MOD1 * MOD2;static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;static constexpr unsigned long long i1 =internal::inv_gcd(MOD2 * MOD3, MOD1).second;static constexpr unsigned long long i2 =internal::inv_gcd(MOD1 * MOD3, MOD2).second;static constexpr unsigned long long i3 =internal::inv_gcd(MOD1 * MOD2, MOD3).second;auto c1 = convolution<MOD1>(a, b);auto c2 = convolution<MOD2>(a, b);auto c3 = convolution<MOD3>(a, b);std::vector<long long> c(n + m - 1);for (int i = 0; i < n + m - 1; i++) {unsigned long long x = 0;x += (c1[i] * i1) % MOD1 * M2M3;x += (c2[i] * i2) % MOD2 * M1M3;x += (c3[i] * i3) % MOD3 * M1M2;// B = 2^63, -B <= x, r(real value) < B// (x, x - M, x - 2M, or x - 3M) = r (mod 2B)// r = c1[i] (mod MOD1)// focus on MOD1// r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)// r = x,// x - M' + (0 or 2B),// x - 2M' + (0, 2B or 4B),// x - 3M' + (0, 2B, 4B or 6B) (without mod!)// (r - x) = 0, (0)// - M' + (0 or 2B), (1)// -2M' + (0 or 2B or 4B), (2)// -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)// we checked that// ((1) mod MOD1) mod 5 = 2// ((2) mod MOD1) mod 5 = 3// ((3) mod MOD1) mod 5 = 4long long diff =c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));if (diff < 0) diff += MOD1;static constexpr unsigned long long offset[5] = {0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};x -= offset[diff % 5];c[i] = x;}return c;}} // namespace atcoderusing namespace atcoder;signed main(){lint n,k;cin>>n>>k;vec a(n);rep(i,n)cin>>a[i];rep(i,n)a[i]--;perm_tree<lint>pt(a);auto root=pt.get();using np=perm_tree<lint>::node*;auto dfs=[&](auto dfs,np t)->array<mint,12>{// cerr<<t->l<<" "<<t->r<<endl;array<mint,12>res1,res2;fill(all(res1),0);fill(all(res2),0);//res1 ->右端に区切りあり/res2 ->res1の累積和res1[0]=1;res2[0]=1;auto add=[&](const auto&s,const auto&t){array<mint,12> res;fill(all(res),0);for(int i=0;i<(int)s.size();++i)res[i]=s[i]+t[i];return res;};auto mul=[&](const auto&s,const auto&t){array<mint,12> res;fill(all(res),0);for(int i=0;i<(int)s.size();++i){for(int j=0;j<=i;++j){res[i]+=s[j]*t[i-j];}}return res;};auto shift=[&](const auto&s){array<mint,12> res;fill(all(res),0);for(int i=0;i<(int)s.size()-1;++i){res[i+1]=s[i];}return res;};if(t->is_join){for(auto e:t->ch){auto tmp=dfs(dfs,e);res1=add(shift(res2),mul(res1,tmp));res2=add(res2,res1);// if(t->mn==5&&t->mx==9){// debug(tmp);// }}res1[0]=0;res1[1]=0;// if(t==root)debug(res1);}else{for(auto e:t->ch){// if(t==root)cerr<<e->r<<endl;auto tmp=dfs(dfs,e);tmp[1]+=1;res1=mul(res1,tmp);// if(t->mn==5&&t->mx==9){// cerr<<e->l<<e->r<<endl;// debug(tmp);// }}res1[0]=0;res1[1]=0;}return res1;};auto ans=dfs(dfs,root);ans[1]=1;rep(i,1,k+1){cout<<ans[i]<<endl;}}