#994666 (C++17) No.2809 Sort Query

提出ソース
結果

問題	No.2809 Sort Query
ユーザー	hamamu
提出日時	2024-07-12 23:50:00
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	56,233 bytes
コンパイル時間	6,109 ms
コンパイル使用メモリ	320,484 KB
実行使用メモリ	62,272 KB
最終ジャッジ日時	2024-07-12 23:51:06
合計ジャッジ時間	61,056 ms
ジャッジサーバーID （参考情報）	judge4 / judge1
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	12 ms 34,520 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	AC	671 ms 52,792 KB
testcase_32	AC	688 ms 53,432 KB
testcase_33	AC	631 ms 52,928 KB
testcase_34	AC	626 ms 52,664 KB
testcase_35	AC	648 ms 53,180 KB
testcase_36	AC	932 ms 55,168 KB
testcase_37	AC	909 ms 56,632 KB
testcase_38	AC	895 ms 55,224 KB
testcase_39	AC	830 ms 56,636 KB
testcase_40	AC	854 ms 55,096 KB
testcase_41	AC	457 ms 55,276 KB
testcase_42	AC	428 ms 55,096 KB
testcase_43	AC	428 ms 55,224 KB
testcase_44	AC	438 ms 55,100 KB
testcase_45	AC	431 ms 55,096 KB
testcase_46	AC	389 ms 56,692 KB
testcase_47	AC	370 ms 55,952 KB
testcase_48	AC	394 ms 56,812 KB
testcase_49	AC	368 ms 54,964 KB
testcase_50	AC	371 ms 55,280 KB
testcase_51	AC	383 ms 55,096 KB
testcase_52	AC	237 ms 55,096 KB
testcase_53	AC	227 ms 55,192 KB
testcase_54	AC	251 ms 54,972 KB
testcase_55	AC	220 ms 55,120 KB
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	AC	12 ms 34,432 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#if !defined(MYLOCAL)//提出時用テンプレート

#pragma GCC optimize("Ofast")
#if defined(NDEBUG)
#undef NDEBUG
#endif
#include "bits/stdc++.h"
#if !defined(_MSC_VER) && __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using     ll=long long;     using   dd=double;     
using    vll=vector<   ll>; using  vdd=vector< dd>;
using   vvll=vector<  vll>; using vvdd=vector<vdd>;
using  vvvll=vector< vvll>; using vvvdd=vector<vvdd>;
using vvvvll=vector<vvvll>;
using   pll=pair<ll,ll>;  using   tll=tuple<ll,ll,ll>; using   qll=tuple<ll,ll,ll,ll>;
using  vpll=vector< pll>; using  vtll=vector< tll>;    using  vqll=vector< qll>;
using vvpll=vector<vpll>; using vvtll=vector<vtll>;    using vvqll=vector<vqll>;
using namespace chrono;
constexpr ll INF = 1001001001001001001;
struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define EXPAND( x ) x//VS用おまじない
#define overload3(_1,_2,_3,name,...) name
#define overload4(_1,_2,_3,_4,name,...) name
#define overload5(_1,_2,_3,_4,_5,name,...) name
#define rep3(i, S, E)    for (ll i = (S); i <= (E); i++)
#define rep4(i, S, E, t) for (ll i = (S); i <= (E); i+=(t))
#define rep(...) EXPAND(overload4(__VA_ARGS__,rep4,rep3,_,_)(__VA_ARGS__))
#define dep3(i, E, S)    for (ll i = (E); i >= (S); i--)
#define dep4(i, E, S, t) for (ll i = (E); i >= (S); i-=(t))
#define dep(...) EXPAND(overload4(__VA_ARGS__, dep4, dep3,_,_)(__VA_ARGS__))
#define each2(e,v) for (auto && e:v)
#define each3(a,b,v) for (auto &&[a,b]:v)
#define each4(a,b,c,v) for (auto &&[a,b,c]:v)
#define each5(a,b,c,d,v) for (auto &&[a,b,c,d]:v)
#define each(...) EXPAND(overload5(__VA_ARGS__,each5,each4,each3,each2,_)(__VA_ARGS__))
#define ALL1(v)     (v).begin(),     (v).end()
#define ALL2(v,E)   (v).begin(),     (v).begin()+((E)+1)
#define ALL3(v,S,E) (v).begin()+(S), (v).begin()+((E)+1)
#define ALL(...) EXPAND(overload3(__VA_ARGS__, ALL3, ALL2, ALL1)(__VA_ARGS__))
#define all ALL
#define RALL1(v)     (v).rbegin(),     (v).rend()
#define RALL2(v,E)   (v).rbegin(),     (v).rbegin()+((E)+1)
#define RALL3(v,S,E) (v).rbegin()+(S), (v).rbegin()+((E)+1)
#define RALL(...) EXPAND(overload3(__VA_ARGS__, RALL3, RALL2, RALL1)(__VA_ARGS__))
#define rall RALL
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline auto maxe(T &&v,ll S,ll E){ return *max_element(ALL(v,S,E)); }
template<class T> inline auto maxe(T &&v){ return *max_element(ALL(v)); }
template<class T> inline auto mine(T &&v,ll S,ll E){ return *min_element(ALL(v,S,E)); }
template<class T> inline auto mine(T &&v){ return *min_element(ALL(v)); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T,class U=typename remove_reference<T>::type::value_type>
inline U sum(T &&v,ll S,ll E) {return accumulate(all(v,S,E),U());}
template<class T> inline auto sum(T &&v) {return sum(v,0,v.end()-v.begin()-1);}
template<class T> inline ll sz(T &&v){ return (ll)v.size(); }
inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; } //負もOK
inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); } //負もOK

//pair用テンプレート
template<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }
template<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }
template<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }
template<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }
template<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }
template<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }
template<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }
template<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }
template<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a,const pair<T,S> &b){ pair<T,S> c=a; return c-=b; }
template<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }
template<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }

//tuple用テンプレート 出力用のみ
template<class T,class S,class R> inline ostream &operator<<(ostream &os,const tuple<T,S,R> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a); }
template<class T,class S,class R,class Q> inline ostream &operator<<(ostream &os,const tuple<T,S,R,Q> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a) << ' ' << get<3>(a); }

//vector用テンプレート
template<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?" ":"")<<a[i];  return os; }

//array用テンプレート
template<class T,size_t S> inline array<T,S>& operator+=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]+=b[i];  return a; }
template<class T,size_t S> inline array<T,S>& operator-=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]-=b[i];  return a; }
template<class T,size_t S> inline array<T,S>& operator*=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]*=b[i];  return a; }
template<class T,size_t S> inline array<T,S>& operator/=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]/=b[i];  return a; }
template<class T,size_t S> inline array<T,S>& operator%=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]%=b[i];  return a; }
template<class T,size_t S,class R> inline array<T,S>& operator+=(array<T,S> &a,R b){ for (T &e: a) e+=b;  return a; }
template<class T,size_t S,class R> inline array<T,S>& operator-=(array<T,S> &a,R b){ for (T &e: a) e-=b;  return a; }
template<class T,size_t S,class R> inline array<T,S>& operator*=(array<T,S> &a,R b){ for (T &e: a) e*=b;  return a; }
template<class T,size_t S,class R> inline array<T,S>& operator/=(array<T,S> &a,R b){ for (T &e: a) e/=b;  return a; }
template<class T,size_t S,class R> inline array<T,S>& operator%=(array<T,S> &a,R b){ for (T &e: a) e%=b;  return a; }
template<class T,size_t S,class R> inline array<T,S> operator+(const array<T,S> &a,R b){ array<T,S> c=a; return c+=b; }
template<class T,size_t S,class R> inline array<T,S> operator-(const array<T,S> &a,R b){ array<T,S> c=a; return c-=b; }
template<class T,size_t S,class R> inline array<T,S> operator*(const array<T,S> &a,R b){ array<T,S> c=a; return c*=b; }
template<class T,size_t S,class R> inline array<T,S> operator/(const array<T,S> &a,R b){ array<T,S> c=a; return c/=b; }
template<class T,size_t S,class R> inline array<T,S> operator%(const array<T,S> &a,R b){ array<T,S> c=a; return c%=b; }
template<class T,size_t S,class R> inline array<T,S> operator-(R b,const array<T,S> &a){ array<T,S> c=-a; return c+=b; }
template<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a,const array<T,S> &b){ array<T,S> c=a; return c-=b; }
template<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a){ array<T,S> c=a; return c*=(-1); }
template<class T,size_t S> inline ostream &operator<<(ostream &os,const array<T,S> &a){ for (ll i=0; i<(ll)S; i++) os<<(i>0?" ":"")<<a[i];  return os; }

template<class T,size_t S,class R> struct view1d;
template<class T,size_t S,class R> struct view1dIter{
	view1d<T,S,R> *vw=nullptr;
	ll idx=INF;
	view1dIter(){}
	view1dIter(view1d<T,S,R> *vw_,ll idx_):vw(vw_),idx(idx_){}
	view1dIter(const view1dIter<T,S,R> &it):vw(it.vw),idx(it.idx){}
	R &operator*()          { return (*vw)[idx]; }
	R &operator*()     const{ return (*vw)[idx]; }
	R &operator[](ll i)     { return (*vw)[idx+i]; }
	R &operator[](ll i)const{ return (*vw)[idx+i]; }
	auto &operator++(){ idx++; return *this; }
	auto &operator--(){ idx--; return *this; }
	auto operator++(int){ auto it=*this; idx++; return it; }
	auto operator--(int){ auto it=*this; idx--; return it; }
	auto &operator+=(ll n){ idx+=n; return *this; }
	auto &operator-=(ll n){ idx-=n; return *this; }
	auto operator+(ll n){ auto it=*this; return it+=n; }
	auto operator-(ll n){ auto it=*this; return it-=n; }
	ll   operator- (const view1dIter<T,S,R> &it)const{ return idx- it.idx; }
	bool operator< (const view1dIter<T,S,R> &it)const{ return idx< it.idx; }
	bool operator> (const view1dIter<T,S,R> &it)const{ return idx> it.idx; }
	bool operator<=(const view1dIter<T,S,R> &it)const{ return idx<=it.idx; }
	bool operator>=(const view1dIter<T,S,R> &it)const{ return idx>=it.idx; }
	bool operator!=(const view1dIter<T,S,R> &it)const{ return idx!=it.idx; }
	bool operator==(const view1dIter<T,S,R> &it)const{ return idx==it.idx; }
	using iterator_category = random_access_iterator_tag;
	using value_type = R;
	using difference_type = ll;
	using pointer = R*;
	using reference = R&;
};
template<class T,size_t S,class R> struct view1d{
	using Sll=array<ll,S>;
	T &data; //参照先データ
	Sll dsize; //参照先データ各軸のサイズ
	Sll s=Sll(); //view先頭
	Sll d=Sll(); //view方向
	ll len; //view長さ
	R &dummy; //範囲外の値参照
	R dummyj=R(); //範囲外の値実体
	/*---- コンストラクタ ----*/
	view1d(T &v): data(v),dummy(dummyj){
		SetDsize(v,dsize);
		d[S-1]=1;
		len=dsize[S-1];
	}
	//このコンストラクタは、マイナス座標指定を末尾にしない(暫定)
	//代入時Array<ll,2>{...}等と書くため、使い勝手悪い。将来廃止するかも。
	view1d(T &v,Sll s,Sll e,Sll d): data(v),s(s),d(d),len(Len(s,e,d)),dummy(dummyj){
		SetDsize(v,dsize);
	}
	view1d(T &v,Sll s,Sll d,ll len,R &dmy_): data(v),s(s),d(d),len(len),dummy(dmy_){
		SetDsize(v,dsize);
	}

	/*---- 演算 ----*/
	template<class Q> auto &operator =(const Q &b){ rep(i,0,len-1) (*this)[i] =b; return *this; }
	template<class Q> auto &operator+=(const Q &b){ rep(i,0,len-1) (*this)[i]+=b; return *this; }
	template<class Q> auto &operator-=(const Q &b){ rep(i,0,len-1) (*this)[i]-=b; return *this; }
	template<class Q> auto &operator*=(const Q &b){ rep(i,0,len-1) (*this)[i]*=b; return *this; }
	template<class Q> auto &operator/=(const Q &b){ rep(i,0,len-1) (*this)[i]/=b; return *this; }
	template<class Q> auto &operator%=(const Q &b){ rep(i,0,len-1) (*this)[i]%=b; return *this; }
	auto &operator =(const string &b){ return CpSeq(b); }
	template<size_t Q> auto &operator =(const char (&b)[Q]){ return *this=string(b); }
	template<class Q> auto &operator =(const vector<Q> &b){ return CpSeq(b); }
	template<class Q> auto &operator+=(const vector<Q> &b){ return PlSeq(b); }
	template<class Q> auto &operator-=(const vector<Q> &b){ return MnSeq(b); }
	template<class Q> auto &operator*=(const vector<Q> &b){ return PrSeq(b); }
	template<class Q> auto &operator/=(const vector<Q> &b){ return DvSeq(b); }
	template<class Q> auto &operator%=(const vector<Q> &b){ return RmSeq(b); }
	template<class Q,size_t P,class O> auto &operator =(const view1d<Q,P,O> &b){ return CpSeq(b); }
	template<class Q,size_t P,class O> auto &operator+=(const view1d<Q,P,O> &b){ return PlSeq(b); }
	template<class Q,size_t P,class O> auto &operator-=(const view1d<Q,P,O> &b){ return MnSeq(b); }
	template<class Q,size_t P,class O> auto &operator*=(const view1d<Q,P,O> &b){ return PrSeq(b); }
	template<class Q,size_t P,class O> auto &operator/=(const view1d<Q,P,O> &b){ return DvSeq(b); }
	template<class Q,size_t P,class O> auto &operator%=(const view1d<Q,P,O> &b){ return RmSeq(b); }
	template<class Q> auto &CpSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i] =b[i]; return *this; }
	template<class Q> auto &PlSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i]+=b[i]; return *this; }
	template<class Q> auto &MnSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i]-=b[i]; return *this; }
	template<class Q> auto &PrSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i]*=b[i]; return *this; }
	template<class Q> auto &DvSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i]/=b[i]; return *this; }
	template<class Q> auto &RmSeq(const Q &b){ rep(i,0,min(sz(b),len)-1) (*this)[i]%=b[i]; return *this; }
	//template<class Q,class P> static bool eq(const Q &a,const P &b){
	//	return equals(ALL(a),ALL(b));
	//}
	template<class Q,class P> static bool eq(const Q &a,const P &b){
		if ((ll)a.size()!=(ll)b.size()) return false;
		rep(i,0,(ll)a.size()-1){
			if (a[i]!=b[i]) return false;
		}
		return true;
	}
	template<class Q,class P> static bool lt(const Q &a,const P &b){
		ll n=min((ll)a.size(),(ll)b.size());
		rep(i,0,n-1){
			if (a[i]<b[i])return true;
			if (a[i]>b[i])return false;
		}
		return (ll)a.size()<(ll)b.size();
	}
	template<class Q,size_t P,class O> bool operator==(           const view1d<Q,P,O> &b){ return eq(*this,b); }
	template<class Q>                  bool operator==(           const             Q &b){ return eq(*this,b); }
	template<class Q> friend           bool operator==(const Q &a,const view1d<T,S,R> &b){ return eq(    a,b); }
	template<size_t Q>                 bool operator==(           const     char (&b)[Q]){ return eq(*this,string(b)); }
	template<class Q,size_t P,class O> bool operator!=(           const view1d<Q,P,O> &b){ return !(*this==b); }
	template<class Q>                  bool operator!=(           const             Q &b){ return !(*this==b); }
	template<class Q> friend           bool operator!=(const Q &a,const view1d<T,S,R> &b){ return !(    a==b); }
	template<class Q,size_t P,class O> bool operator< (           const view1d<Q,P,O> &b){ return lt(*this,b); }
	template<class Q>                  bool operator< (           const             Q &b){ return lt(*this,b); }
	template<class Q> friend           bool operator< (const Q &a,const view1d<T,S,R> &b){ return lt(    a,b); }
	template<class Q,size_t P,class O> bool operator> (           const view1d<Q,P,O> &b){ return lt(b,*this); }
	template<class Q>                  bool operator> (           const             Q &b){ return lt(b,*this); }
	template<class Q> friend           bool operator> (const Q &a,const view1d<T,S,R> &b){ return lt(b,a    ); }
	template<class Q,size_t P,class O> bool operator<=(           const view1d<Q,P,O> &b){ return !(*this>b); }
	template<class Q>                  bool operator<=(           const             Q &b){ return !(*this>b); }
	template<class Q> friend           bool operator<=(const Q &a,const view1d<T,S,R> &b){ return !(    a>b); }
	template<class Q,size_t P,class O> bool operator>=(           const view1d<Q,P,O> &b){ return !(*this<b); }
	template<class Q>                  bool operator>=(           const             Q &b){ return !(*this<b); }
	template<class Q> friend           bool operator>=(const Q &a,const view1d<T,S,R> &b){ return !(    a<b); }

	/*---- getter ----*/
	ll size() const { return len; }
	R &operator[](ll i){ return const_cast<R&>(OrgAt(s+d*i)); }
	const R &operator[](ll i) const { return OrgAt(s+d*i); }
	R &at(ll i){ if(i<0)i+=len; return (*this)[i]; }
	//vector<R> tov(){ vector<R> vvv(len);  rep(i,0,len-1) vvv[i]=(*this)[i];  return vvv; }
	operator vector<R>(){ vector<R> v(len);  rep(i,0,len-1) v[i]=(*this)[i];  return v; }
	bool contains(R a){ rep(i,0,len-1) if((*this)[i]==a)return true;  return false; }
	auto begin(){ return view1dIter<T,S,R>(this,0); }
	auto end(){ return view1dIter<T,S,R>(this,len); }
	/*---- view設定 ----*/
	view1d<T,S,R> &dmy(R dmy_) { dummy=dmy_; return *this; }//ダミー値セット
	template<class...Q> view1d<T,S,R> &st(Q... s_){//始点set 負は末尾からの位置
		this->s=RevIfNeg(SllD(s_...));
		this->len=AutoLen(this->s,this->d,this->dsize);
		return *this;
	}
	template<class...Q> view1d<T,S,R> &en(Q... e_){//終了条件再設定 負は末尾から
		this->len=Len(s, RevIfNeg(SllD(e_...)), d);
		return *this;
	}
	template<class...Q> view1d<T,S,R> &dir(Q... d_){//方向set、長さはdata端まで
		this->d=SllD(d_...);
		this->len=AutoLen(this->s,this->d,this->dsize);
		return *this;
	}
	template<class...Q>
	view1d<T,S,R> &mv(Q... s_){ this->s+=SllD(s_...); return *this; }//平行移動
	view1d<T,S,R> &size(ll len_) { len=len_; return *this; }//長さset
	template<class Q> view1d<T,S,R> &size(Q &v){ len=(ll)v.size(); return *this; }//長さset
	view1d<T,S,R> &rev() { s+=d*(len-1); d*=-1; return *this; }//反転

	/*---- utility ----*/
	template<class Q> inline static ll sz(Q &v){ return (ll)v.size(); }
	Sll RevIfNeg(Sll pos){//!< 負なら末尾からの位置に変換
		rep(i,0,S-1)  if (pos[i]<0) pos[i]+=dsize[i];
		return pos;
	}
	static ll AutoLen(Sll s_,Sll d_,Sll dsz){//位置s_から方向d_ではみ出すまでの長さ
		Sll e=dsz-1;
		rep(i,0,S-1) e[i] *= (d_[i]>=0);//方向が負の軸を0にする
		return Len(s_,e,d_);
	}
	/*---- 先頭位置s、方向d、終了条件eから長さlen計算 ----*/
	//template<size_t Q> static ll Len(array<ll,Q> s,array<ll,Q> e,array<ll,Q> d){
	//	ll ret=INF;
	//	rep(i,0,Q-1) chmin(ret, Len1(s[i],e[i],d[i]));
	//	return ret;
	//}
	static ll Len(Sll s,Sll e,Sll d){
		ll ret=INF;
		rep(i,0,S-1) chmin(ret, Len1(s[i],e[i],d[i]));
		return ret;
	}
	static ll Len1(ll s,ll e,ll d){
		if (d==0) return INF;
		if (d<0){ s=-s; e=-e; d=-d; }
		if (s>e) return 0;
		return (e-s)/d+1;
	}
	/*---- 可変長引数をSllに変換 ----*/
	template<class...Q> static Sll SllD(Q... args){ return SllRec(0,args...); }
	template<class...Q> static Sll SllRec(ll i,ll first,Q... rest) {
		Sll sll = (i==S-1) ? Sll() : SllRec(i+1,rest...);
		sll[i]=first;
		return sll;
	}
	static Sll SllRec(ll i){ return Sll(); }
	/*---- dataの位置posの値取得 ----*/
	const R &OrgAt(Sll pos) const {
		rep(i,0,S-1){
			if (pos[i]<0 || dsize[i]<=pos[i]) return dummy;
		}
		return OrgAt_(data,pos);
	}
	template<class Q> using V   = vector<Q>;
	template<class Q> using VV  = V<V<Q>>;
	template<class Q> using VVV = V<V<V<Q>>>;
	using Vs  = V<string>;
	using VVs = VV<string>;
	using ll1 = array<ll,1>;
	using ll2 = array<ll,2>;
	using ll3 = array<ll,3>;
	auto &OrgAt_(V<R>   &dat,ll1 pos)const{ auto [i]    =pos; return dat[i]; }
	auto &OrgAt_(string &dat,ll1 pos)const{ auto [i]    =pos; return dat[i]; }
	auto &OrgAt_(VV<R>  &dat,ll2 pos)const{ auto [i,j]  =pos; return dat[i][j]; }
	auto &OrgAt_(Vs     &dat,ll2 pos)const{ auto [i,j]  =pos; return dat[i][j]; }
	auto &OrgAt_(VVV<R> &dat,ll3 pos)const{ auto [i,j,k]=pos; return dat[i][j][k]; }
	auto &OrgAt_(VVs    &dat,ll3 pos)const{ auto [i,j,k]=pos; return dat[i][j][k]; }
	/*---- dataの各軸size取得 ----*/
	static void SetDsize(V<R>   &dat,ll1 &dsz){ dsz={sz(dat)}; }
	static void SetDsize(string &dat,ll1 &dsz){ dsz={sz(dat)}; }
	static void SetDsize(VV<R>  &dat,ll2 &dsz){ dsz={sz(dat),sz(dat[0])}; }
	static void SetDsize(Vs     &dat,ll2 &dsz){ dsz={sz(dat),sz(dat[0])}; }
	static void SetDsize(VVV<R> &dat,ll3 &dsz){ dsz={sz(dat),sz(dat[0]),sz(dat[0][0])}; }
	static void SetDsize(VVs    &dat,ll3 &dsz){ dsz={sz(dat),sz(dat[0]),sz(dat[0][0])}; }
	typedef view1dIter<T,S,R> iterator;
	using value_type = R;
};
template<class Q> using V   = vector<Q>;
template<class Q> using VV  = V<V<Q>>;
template<class Q> using VVV = V<V<V<Q>>>;
template<class T>         view1d(    VVV<T>      ) -> view1d<    VVV<T>,3,T>;
template<class T>         view1d(     VV<T>      ) -> view1d<     VV<T>,2,T>;
template<class T>         view1d(      V<T>      ) -> view1d<      V<T>,1,T>;
;                         view1d(VV<string>      ) -> view1d<VV<string>,3,char>;
;                         view1d( V<string>      ) -> view1d< V<string>,2,char>;
;                         view1d(   string       ) -> view1d<   string ,1,char>;
template<class T,class S> view1d(    VVV<T>,S,S,S) -> view1d<    VVV<T>,3,T>;
template<class T,class S> view1d(     VV<T>,S,S,S) -> view1d<     VV<T>,2,T>;
template<class T,class S> view1d(      V<T>,S,S,S) -> view1d<      V<T>,1,T>;
template<class S>         view1d(VV<string>,S,S,S) -> view1d<VV<string>,3,char>;
template<class S>         view1d( V<string>,S,S,S) -> view1d< V<string>,2,char>;
template<class S>         view1d(   string ,S,S,S) -> view1d<   string ,1,char>;


template<class VIEW2D> struct view2dIter{
	VIEW2D *vw=nullptr;
	ll idx=INF;
	view2dIter(){}
	view2dIter(VIEW2D *vw_,ll idx_):vw(vw_),idx(idx_){}
	view2dIter(const view2dIter &it):vw(it.vw),idx(it.idx){}
	auto &operator*()          { return (*vw)[x(idx)][y(idx)]; }
	auto &operator*()     const{ return (*vw)[x(idx)][y(idx)]; }
	auto &operator[](ll i)     { return (*vw)[x(idx+i)][y(idx+i)]; }
	auto &operator[](ll i)const{ return (*vw)[x(idx+i)][y(idx+i)]; }
	auto &operator++(){ idx++; return *this; }
	auto &operator--(){ idx--; return *this; }
	auto operator++(int){ auto it=*this; idx++; return it; }
	auto operator--(int){ auto it=*this; idx--; return it; }
	auto &operator+=(ll n){ idx+=n; return *this; }
	auto &operator-=(ll n){ idx-=n; return *this; }
	auto operator+(ll n){ auto it=*this; return it+=n; }
	auto operator-(ll n){ auto it=*this; return it-=n; }
	ll   operator- (const view2dIter &it)const{ return idx- it.idx; }
	bool operator< (const view2dIter &it)const{ return idx< it.idx; }
	bool operator> (const view2dIter &it)const{ return idx> it.idx; }
	bool operator<=(const view2dIter &it)const{ return idx<=it.idx; }
	bool operator>=(const view2dIter &it)const{ return idx>=it.idx; }
	bool operator!=(const view2dIter &it)const{ return idx!=it.idx; }
	bool operator==(const view2dIter &it)const{ return idx==it.idx; }
	ll x(ll i)const{ return i/vw->leny(); }
	ll y(ll i)const{ return i%vw->leny(); }
	using iterator_category = random_access_iterator_tag;
	using value_type = typename VIEW2D::value_type;
	using difference_type = ll;
	using pointer = value_type*;
	using reference = value_type&;
};


template<class T,size_t S,class R> struct view2d{
	using Sll=array<ll,S>;
	T &data; //参照先データ
	Sll dsize; //参照先データ各軸のサイズ
	Sll s=Sll(); //view始点
	Sll dx=Sll(); //view x軸方向
	Sll dy=Sll(); //view y軸方向
	ll xl; //view x軸長さ
	ll yl; //view y軸長さ
	R dummy=R(); //範囲外の値
	/*---- コンストラクタ ----*/
	view2d(T &v): data(v){
		view1d<T,S,R>::SetDsize(v,dsize);
		dx[S-2]=1;
		dy[S-1]=1;
		xl=dsize[S-2];
		yl=dsize[S-1];
	}
	/*---- 演算 ----*/
	//template<class Q> auto &operator =(const Q &b){ rep(i,0,xl-1) (*this)[i] =b; return *this; }
	//template<class Q,size_t P,class O> auto &operator+=(const view2d<Q,P,O> &b){
	//	rep(i,0,xl-1) (*this)[i]
	//	return PlSeq(b); }
	/*---- getter ----*/
	ll size() const { return xl; }
	array<ll,2> shape() const { return {xl,yl}; }
	ll lenx() const { return xl; }
	ll leny() const { return yl; }
	///pll shape() const { return {xl,yl}; }
	view1d<T,S,R> operator[](ll i){ return view1d(data,s+dx*i,dy,yl,dummy); }
	const view1d<T,S,R> operator[](ll i) const { return view1d(data,s+dx*i,dy,yl,dummy); }
	R &at(ll i,ll j){ if(i<0)i+=xl;  if(j<0)j+=yl;  return (*this)[i][j]; }
	//vector<vector<R>> tovv(){
	//	vector<vector<R>> vvv(xl);
	//	///rep(i,0,xl-1) vvv[i]=(*this)[i].tov();  return vvv;
	//	rep(i,0,xl-1) vvv[i]=(*this)[i];  return vvv;
	//}
	operator vector<vector<R>>(){
		vector<vector<R>> v(xl);
		rep(i,0,xl-1){ v[i]=(*this)[i]; }  return v;
	}
	auto begin(){ return view2dIter(this,0); }
	auto end(){ return view2dIter(this,xl*yl); }
#if defined(_DEBUG)
	void dump(){ ::dump(tovv()); }
#endif
	/*---- view設定 ----*/
	view2d<T,S,R> &dmy(R dmy_) { dummy=dmy_; return *this; }//ダミー値セット
	template<class...Q> view2d<T,S,R> &st(Q... s_){//始点set 負は末尾からの位置
		this->s=RevIfNeg(view1d<T,S,R>::SllD(s_...));
		this->xl=view1d<T,S,R>::AutoLen(this->s,this->dx,this->dsize);
		this->yl=view1d<T,S,R>::AutoLen(this->s,this->dy,this->dsize);
		return *this;
	}
	template<class...Q> view2d<T,S,R> &dirx(Q... d_){//x軸set、長さはdata端まで
		this->dx=view1d<T,S,R>::SllD(d_...);
		this->xl=view1d<T,S,R>::AutoLen(this->s,this->dx,this->dsize);
		return *this;
	}
	template<class...Q> view2d<T,S,R> &diry(Q... d_){//y軸set、長さはdata端まで
		this->dy=view1d<T,S,R>::SllD(d_...);
		this->yl=view1d<T,S,R>::AutoLen(this->s,this->dy,this->dsize);
		return *this;
	}
	template<class...Q> view2d<T,S,R> &mv(Q... s_){//平行移動
		this->s += view1d<T,S,R>::SllD(s_...);
		return *this;
	}
	view2d<T,S,R> &lenx(ll xl_) { xl=xl_; return *this; }
	view2d<T,S,R> &leny(ll yl_) { yl=yl_; return *this; }
	view2d<T,S,R> &shape(ll xl_,ll yl_) { xl=xl_; yl=yl_; return *this; }
	template<class Q> view2d<T,S,R> &shape(Q &v) { xl=v.lenx(); yl=v.leny(); return *this; }
	view2d<T,S,R> &rot90 () { s+=dx*(xl-1); swap(xl,yl); swap(dx,dy); dy*=-1; return *this; }
	view2d<T,S,R> &rot270() { s+=dy*(yl-1); swap(xl,yl); swap(dx,dy); dx*=-1; return *this; }
	view2d<T,S,R> &rot180() { s+=dx*(xl-1)+dy*(yl-1); dx*=-1; dy*=-1; return *this; }
	view2d<T,S,R> &revx() { s+=dx*(xl-1); dx*=-1; return *this; }
	view2d<T,S,R> &revy() { s+=dy*(yl-1); dy*=-1; return *this; }
	view2d<T,S,R> &swapxy() { swap(xl,yl); swap(dx,dy); return *this; }//xy軸入替

	/*---- utility ----*/
	Sll RevIfNeg(Sll pos){//!< 負なら末尾からの位置に変換
		rep(i,0,S-1)  if (pos[i]<0) pos[i]+=dsize[i];
		return pos;
	}
	using value_type = R;
};
template<class T> view2d(    VVV<T>) -> view2d<    VVV<T>,3,T>;
template<class T> view2d(     VV<T>) -> view2d<     VV<T>,2,T>;
;                 view2d(VV<string>) -> view2d<VV<string>,3,char>;
;                 view2d( V<string>) -> view2d< V<string>,2,char>;



/*
zipは参照のpairを返す。それをさらに参照するのはまずいので、コピーする。
*/
template<class ZIP> struct zipIter{
	ZIP *z=nullptr;
	ll idx=INF;
	zipIter(){}
	zipIter(ZIP *z_,ll idx_):z(z_),idx(idx_){}
	zipIter(const zipIter<ZIP> &it):z(it.z),idx(it.idx){}
	auto operator*()          { return (*z)[idx]; }//参照ではなく値戻し
	auto operator*()     const{ return (*z)[idx]; }//同上
	auto operator[](ll i)     { return (*z)[idx+i]; }//同上
	auto operator[](ll i)const{ return (*z)[idx+i]; }//同上
	auto &operator++(){ idx++; return *this; }
	auto &operator--(){ idx--; return *this; }
	auto operator++(int){ auto it=*this; idx++; return it; }
	auto operator--(int){ auto it=*this; idx--; return it; }
	auto &operator+=(ll n){ idx+=n; return *this; }
	auto &operator-=(ll n){ idx-=n; return *this; }
	auto operator+(ll n){ auto it=*this; return it+=n; }
	auto operator-(ll n){ auto it=*this; return it-=n; }
	ll   operator- (const zipIter<ZIP> &it)const{ return idx- it.idx; }
	bool operator< (const zipIter<ZIP> &it)const{ return idx< it.idx; }
	bool operator> (const zipIter<ZIP> &it)const{ return idx> it.idx; }
	bool operator<=(const zipIter<ZIP> &it)const{ return idx<=it.idx; }
	bool operator>=(const zipIter<ZIP> &it)const{ return idx>=it.idx; }
	bool operator!=(const zipIter<ZIP> &it)const{ return idx!=it.idx; }
	bool operator==(const zipIter<ZIP> &it)const{ return idx==it.idx; }
	using iterator_category = random_access_iterator_tag;
	using value_type = typename ZIP::value_type;
	using difference_type = ll;
	using pointer = value_type*;
	using reference = value_type&;
};

template<class T,class S> struct zip2{
	T &t; S &s;
	zip2(T &t_,S &s_):t(t_),s(s_){}
	ll size() const { return t.end()-t.begin(); }
	auto operator[](ll i)     { return make_pair(ref(t.begin()[i]),ref(s.begin()[i])); }
	auto operator[](ll i)const{ return make_pair(ref(t.begin()[i]),ref(s.begin()[i])); }
	auto begin(){ return zipIter(this,0); }
	auto end(){ return zipIter(this,size()); }
	using value_type = pair<typename T::value_type,typename S::value_type>;
};
template<class T,class S,class R> struct zip3{
	T &t; S &s; R &r;
	zip3(T &t_,S &s_,R &r_):t(t_),s(s_),r(r_){}
	ll size() const { return t.end()-t.begin(); }
	auto operator[](ll i)     { return make_tuple(ref(t.begin()[i]),ref(s.begin()[i]),ref(r.begin()[i])); }
	auto operator[](ll i)const{ return make_tuple(ref(t.begin()[i]),ref(s.begin()[i]),ref(r.begin()[i])); }
	auto begin(){ return zipIter(this,0); }
	auto end(){ return zipIter(this,size()); }
	using value_type = tuple<typename T::value_type,typename S::value_type,typename R::value_type>;
};
#endif//テンプレートend

#if defined(_MSC_VER) && __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#if defined(_MSC_VER)
#pragma warning( disable : 4996 )
#endif
struct{
	system_clock::time_point st = system_clock::now();
	ll operator()()const{return duration_cast<microseconds>(system_clock::now()-st).count()/1000;}
} timeget;
//////////////////////////////////////////

struct cinutil{
	template<class T> static void cin1core(T &a){ cin>>a; }
	template<class T,class S> static void cin1core(pair<T,S> &a){
		cin1core(a.first), cin1core(a.second);
	}
	template<class... Args> static void cin1core(tuple<Args...> &a){
		cinTplRec<tuple<Args...>,sizeof...(Args)-1>()(a);
	}
private:
	template<class Tpl,int i> struct cinTplRec{
		void operator()(Tpl &a){ cinTplRec<Tpl,i-1>()(a); cin1core(get<i>(a)); }
	};
	template<class Tpl> struct cinTplRec<Tpl,0>{
		void operator()(Tpl &a){ cin1core(get<0>(a)); }
	};
};
template<class T> T cin1(){ T a; cinutil::cin1core(a); return a; }
template<class... Args> tuple<Args...> cins(){ return cin1<tuple<Args...>>(); }


struct fraction{
	ll bunsi=0,bunbo=1;
	/*---- utilty ----*/
	fraction &norm(){//正規化(約分,分母正)
		ll g=gcd(bunsi,bunbo);
		bunsi/=g,bunbo/=g;
		if (bunbo<0) bunsi*=-1,bunbo*=-1;
		return *this;
	}
	fraction &invsg(){//正負反転
		bunsi*=-1;
		return *this;
	}
	/*---- I/F ----*/
	fraction(){}
	fraction(ll bunsi_,ll bunbo_):bunsi(bunsi_),bunbo(bunbo_){
		norm();
	}
	fraction(ll b):bunsi(b){}//整数用コンストラクタ
	fraction(ll bunsi_,ll bunbo_,bool)//正規化無のコンストラクタ
		:bunsi(bunsi_),bunbo(bunbo_){}

	fraction &operator+=(fraction b){
		ll bo=bunbo*b.bunbo;
		ll si=bunsi*b.bunbo + b.bunsi*bunbo;
		bunsi=si,bunbo=bo;
		return norm();
	}
	fraction &operator-=(fraction b){
		return (*this)+=b.invsg();
	}
	fraction &operator*=(fraction b){
		bunsi*=b.bunsi;
		bunbo*=b.bunbo;
		return norm();
	}
	fraction &operator/=(fraction b){
		return (*this)*=b.inv();
	}
	fraction &operator+=(ll b){ bunsi+=bunbo*b; return *this; }
	fraction &operator-=(ll b){ return (*this)+=-b; }
	fraction &operator*=(ll b){ bunsi*=b; return norm(); }
	fraction &operator/=(ll b){ bunbo*=b; return norm(); }
	fraction operator-()const{ return {-bunsi,bunbo,0}; }
	fraction operator+(const fraction &b)const{ return fraction(*this)+=b; }
	fraction operator-(const fraction &b)const{ return fraction(*this)-=b; }
	fraction operator*(const fraction &b)const{ return fraction(*this)*=b; }
	fraction operator/(const fraction &b)const{ return fraction(*this)/=b; }
	fraction operator+(ll b)const{ return fraction(*this)+=b; }
	fraction operator-(ll b)const{ return fraction(*this)-=b; }
	fraction operator*(ll b)const{ return fraction(*this)*=b; }
	fraction operator/(ll b)const{ return fraction(*this)/=b; }
	friend fraction operator+(ll a,const fraction &b){ return b+a; }
	friend fraction operator-(ll a,const fraction &b){ return -b+a; }
	friend fraction operator*(ll a,const fraction &b){ return b*a; }
	friend fraction operator/(ll a,const fraction &b){ return b.inv()*a; }
	bool operator==(const fraction &b)const{
		return bunsi==b.bunsi && bunbo==b.bunbo;
	}
	bool operator!=(const fraction &b)const{ return !(*this==b); }
	bool operator<(const fraction &b)const{
		return (b-*this).bunsi>0;
	}
	bool operator>(const fraction &b)const{ return b<*this; }
	bool operator>=(const fraction &b)const{ return !(*this<b); }
	bool operator<=(const fraction &b)const{ return b>=*this; }
	friend ostream &operator << (ostream &os,const fraction &a){
		return os<<a.bunsi<<'/'<<a.bunbo;
	}
	fraction inv()const{
		if (bunsi<0) return {-bunbo,-bunsi,0};
		else         return {bunbo, bunsi,0};
	}
};
/*
- 定義   ↓b分のa (a/b)
fraction x(a,b);
.        ↓整数a
fraction x(a);
.        ↓正規化無(約分と分母正化なしで良い時)
fraction x(a,b,true);
fraction y=x.inv(); 逆数
x+y,x-y,x*y,x/y,-x,  x+=y,x-=y,x*=y,x/=y,  x==y,x!=y,x<y,x>y,x<=y,x>=y
cout << x; //"a/b"と表示
*/

template<long long MOD> struct mll_{
	using Int = long long;
	using ll = long long;
	ll val_=0;
	/*---- utility ----*/
	mll_ &norm(){ return normR().normS(); }//正規化
	mll_ &normR(){ val_%=MOD; return *this; }//剰余正規化のみ
	mll_ &normS(){ if (val_<0) val_+=MOD; return *this; }//正負正規化のみ
	mll_ &normP(){ if (val_>=MOD) val_-=MOD; return *this; }//加算時正規化
	mll_ &invsg(){ val_=-val_; return normS(); }//正負反転
	ll modinv(int a){//a^-1 mod MOD
		int ypre=0,y=1,apre=MOD;
		while (a>1){
			int t=apre/a;
			apre-=a*t,swap(a,apre);
			ypre-=y*t,swap(y,ypre);
		}
		return y<0 ? y+MOD: y;
	}
	/*---- I/F ----*/
	mll_(){}
	mll_(ll v): val_(v){ norm(); }
	mll_(ll v,bool b): val_(v){} //正規化無のコンストラクタ
	Int val()const{ return (Int)val_; }
	bool isnone() const { return val_==-1; } //true:値なし
	mll_ &none() { val_=-1; return *this; } //値なしにする
	mll_ &inv(){ val_=modinv((int)val_); return *this; }
	mll_ &operator+=(mll_ b){ val_+=b.val_; return normP(); }
	mll_ &operator-=(mll_ b){ val_-=b.val_; return normS(); }
	mll_ &operator*=(mll_ b){ val_*=b.val_; return normR(); }
	mll_ &operator/=(mll_ b){ return *this*=b.inv(); }
	mll_ &operator+=(ll b){ return *this+=mll_(b); }
	mll_ &operator-=(ll b){ return *this-=mll_(b); }
	mll_ &operator*=(ll b){ return *this*=mll_(b); }
	mll_ &operator/=(ll b){ return *this/=mll_(b); }
	mll_ operator-()const{ return mll_(*this).invsg(); }
	mll_ operator+(mll_ b)const{ return mll_(*this)+=b; }
	mll_ operator-(mll_ b)const{ return mll_(*this)-=b; }
	mll_ operator*(mll_ b)const{ return mll_(*this)*=b; }
	mll_ operator/(mll_ b)const{ return mll_(*this)/=b; }
	mll_ operator+(ll b)const{ return mll_(*this)+=b; }
	mll_ operator-(ll b)const{ return mll_(*this)-=b; }
	mll_ operator*(ll b)const{ return mll_(*this)*=b; }
	mll_ operator/(ll b)const{ return mll_(*this)/=b; }
	friend mll_ operator+(ll a,mll_ b){ return b+a; }
	friend mll_ operator-(ll a,mll_ b){ return -b+a; }
	friend mll_ operator*(ll a,mll_ b){ return b*a; }
	friend mll_ operator/(ll a,mll_ b){ return mll_(a)/b; }
	bool operator==(mll_ b)const{ return val_==b.val_; }
	bool operator!=(mll_ b)const{ return val_!=b.val_; }
	bool operator==(ll b)const{ return *this==mll_(b); }
	bool operator!=(ll b)const{ return *this!=mll_(b); }
	friend bool operator==(ll a,mll_ b){ return mll_(a)==b; }
	friend bool operator!=(ll a,mll_ b){ return mll_(a)!=b; }
	friend ostream &operator<<(ostream &os,mll_  a){ return os << a.val_; }
	friend istream &operator>>(istream &is,mll_ &a){ return is >> a.val_; }
	mll_ pow(ll k)const{
		mll_ ret(1,false),a(*this);
		for (; k>0; k>>=1,a*=a) if (k&1)ret*=a;
		return ret;
	}
	static constexpr int mod() { return MOD; }
	//enum{ modll=MOD };
};
#if 0
#define MODLL (1000000007LL)
#else
#define MODLL (998244353LL)
#endif
using mll = mll_<MODLL>;
//using mll = fraction;
using vmll    = std::vector<mll>;
using vvmll   = std::vector<vmll>;
using vvvmll  = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;


template<class T> struct Vector: vector<T>{
	using Int = long long;
	using vT=vector<T>;
	using cvT=const vector<T>;
	using cT=const T;
	using vT::vT; //親クラスのコンストラクタの隠蔽を回避
	using vT::begin,vT::end,vT::insert,vT::erase;
	auto it(Int i){ return begin()+i; }
	auto it(Int i)const{ return begin()+i; }
	Vector(cvT& b):vT(b){}
	Vector(vT&& b):vT(move(b)){}
	template<class S> Vector(const Vector<S>& b):vT(b.begin(),b.end()){}
	template<class S> Vector(const vector<S>& b):vT(b.begin(),b.end()){}
	Vector(Int n,T s,T d){ iota(n,s,d); }
	Vector(Int n,function<T(Int)> g):vT(n){ for (Int i=0;i<n;++i) (*this)[i]=g(i); }
	template<class S> Vector &operator+=(S x){ for (T &e: *this) e+=x;  return *this; }
	template<class S> Vector &operator-=(S x){ for (T &e: *this) e-=x;  return *this; }
	template<class S> Vector &operator*=(S x){ for (T &e: *this) e*=x;  return *this; }
	template<class S> Vector &operator/=(S x){ for (T &e: *this) e/=x;  return *this; }
	template<class S> Vector &operator%=(S x){ for (T &e: *this) e%=x;  return *this; }
	template<class S> Vector operator+(S x)const{ return Vector(*this)+=x; }
	template<class S> Vector operator-(S x)const{ return Vector(*this)-=x; }
	template<class S> Vector operator*(S x)const{ return Vector(*this)*=x; }
	template<class S> Vector operator/(S x)const{ return Vector(*this)/=x; }
	template<class S> Vector operator%(S x)const{ return Vector(*this)%=x; }
	Vector operator-()const{ return Vector(*this)*=-1; }
	template<class S> friend Vector operator-(S x,const Vector &a){ return -a+=x; }
	Int size()const{ return (Int)vT::size(); }
	Vector &push_back(cT& x){ vT::push_back(x); return *this; }
	Vector &pop_back(){ vT::pop_back(); return *this; }
	Vector &push_front(cT& x){ insert(begin(),x); return *this; }
	Vector &pop_front(){ erase(0); return *this; }
	Vector &insert(Int i,cT& x){ insert(it(i),x); return *this; }
	Vector &insert(Int i,cvT& b){ insert(it(i),b.begin(),b.end()); return *this; }
	Vector &erase(Int i){ erase(it(i)); return *this; }
	Vector &erase(Int l,Int r){ erase(it(l),it(r+1)); return *this; }
	Vector &concat(cvT &b){ insert(end(),b.begin(),b.end()); return *this; }
	Vector &concat(cvT &b,Int n){ for (int i=0;i<n;++i) concat(b); return *this; }
	Vector &repeat(Int n){ concat(vT(*this),n-1); return *this; }
	Vector &reverse(){ std::reverse(begin(),end()); return *this; }
	Vector &sort(){ std::sort(begin(),end()); return *this; }
	Vector &rsort(){ std::sort(vT::rbegin(),vT::rend()); return *this; }
	template<class Pr> Vector &sort(Pr pr){ std::sort(begin(),end(),pr); return *this; }
	Vector &uniq(){ erase(unique(begin(),end()),end()); return *this; }
	Vector &sortq(){ return sort().uniq(); }
	Vector &fill(Int l,Int r,cT& x){ std::fill(it(l),it(r+1),x); return *this; }
	template<class S=Int> Vector &iota(Int n,T s=0,S d=1){
		vT::resize(n);
		if (n==0) return *this;
		(*this)[0]=s;
		for (int i=1;i<n;++i) (*this)[i]=(*this)[i-1]+d;
		return *this;
	}
	Int count(cT& x)const{ return Int(std::count(begin(),end(),x)); }
	Int count(Int l,Int r,cT& x)const{ return Int(std::count(it(l),it(r+1),x)); }
	template<class Pr> Int countif(Pr pr)const{ return Int(count_if(begin(),end(),pr)); }
	template<class Pr> Int countif(Int l,Int r,Pr pr)const{ return Int(count_if(it(l),it(r+1),pr)); }
	Int find(cT& x)const{ return Int(std::find(begin(),end(),x)-begin()); }
	Int find(Int l,Int r,cT& x)const{ return Int(std::find(it(l),it(r+1),x)-begin()); }
	template<class Pr> Int findif(Pr pr)const{ return Int(find_if(begin(),end(),pr)-begin()); }
	template<class Pr> Int findif(Int l,Int r,Pr pr)const{ return Int(find_if(it(l),it(r+1),pr)-begin()); }
	Vector<Int> findall(cT& x)const{ return findall(0,size()-1,x); }
	Vector<Int> findall(Int l,Int r,cT& x)const{ return findallif(l,r,[&](cT& y){return y==x;}); }
	template<class Pr> Vector<Int> findallif(Pr pr)const{ return findallif(0,size()-1,pr); }
	template<class Pr> Vector<Int> findallif(Int l,Int r,Pr pr)const{
		Vector<Int> ret;
		for (Int i=l;i<=r;++i) if (pr((*this)[i])) ret.push_back(i);
		return ret;
	}
	Int  flooridx(cT& x)const{ return Int(upper_bound(begin(),end(),x)-begin()-1); }
	Int   ceilidx(cT& x)const{ return Int(lower_bound(begin(),end(),x)-begin()); }
	Int  leftnmof(cT& x)const{ return flooridx(x)+1; }
	Int rightnmof(cT& x)const{ return size()-ceilidx(x); }
	bool contains(cT& x)const{ Int i=flooridx(x); return i>=0 && (*this)[i]==x; }
	template<class Pr> Int  flooridx(cT& x,Pr pr)const{ return Int(upper_bound(begin(),end(),x,pr)-begin()-1); }
	template<class Pr> Int   ceilidx(cT& x,Pr pr)const{ return Int(lower_bound(begin(),end(),x,pr)-begin()); }
	template<class Pr> Int  leftnmof(cT& x,Pr pr)const{ return flooridx(x,pr)+1; }
	template<class Pr> Int rightnmof(cT& x,Pr pr)const{ return size()-ceilidx(x,pr); }
	template<class Pr> bool contains(cT& x,Pr pr)const{ Int i=flooridx(x,pr); return i>=0 && (*this)[i]==x; }
};
/*
vll a={9,8,7},b={1,2,3};
vpll p={{5,3},{7,8},{0,2},};
- -------- 操作系 --------
a+=x a-=x a*=x a/=x a%=x a+x a-x a*x a/x a%x -a x-a  //∀i a[i]にxを演算
a.push_front(x);
a.push_back(x);
a.pop_front();
a.pop_back();
a.insert(i,x); //a[i]にx挿入
a.insert(i,b); //a[i]にvll b挿入
a.erase(i);    //a[i]削除
a.erase(l,r);  //区間[l,r]削除
a.concat(b);   //aにbを結合
a.concat(b,n); //aにbをn回結合
a.repeat(n);   //aをn回繰り返す
a.reverse(); //反転
a.sort();    //ソート
a.rsort();   //逆順ソート
p.sort([&](pll x,pll y){return x.second<y.second;});//比較関数指定ソート
a.uniq();      //連続同値を1つにする
a.sortq();     //ソートしてユニーク
a.fill(l,r,x); //[l,r]にx代入
a.iota(n,s,d); //aを等差数列にする 長さn,初項s,公差d
vll a(n,s,d);  //コンストラクタ版iota
- -------- 検索系 --------
auto pr=[&](auto &x){ return x>0; };  //検索条件
ll m=a.count(x);     //xの個数
ll m=a.count(l,r,x); //xの個数in[l,r]
ll m=a.countif(pr);     //条件満たす個数
ll m=a.countif(l,r,pr); //条件満たす個数in[l,r]
ll i=a.find(x);         //xの最左位置i         ない時N(配列長)
ll i=a.find(l,r,x);     //xの最左位置i in[l,r] ない時r+1
ll i=a.findif(pr);      //条件満たす最左位置i         ない時N(配列長)
ll i=a.findif(l,r,pr);  //条件満たす最左位置i in[l,r] ない時r+1
vll is=a.findall(x);        //xの位置i列挙
vll is=a.findall(l,r,x);    //xの位置i列挙in[l,r]
vll is=a.findallif(pr);     //条件満たす位置i列挙
vll is=a.findallif(l,r,pr); //条件満たす位置i列挙in[l,r]
- -------- 昇順sort済み配列用 --------
ll i=a.flooridx(x);   //x以下の最近傍位置i ない時-1
ll i=a.ceilidx(x);    //x以上の最近傍位置i ない時N(配列長)
ll m=a.leftnmof(x);   //x以下の個数
ll m=a.rightnmof(x);  //x以上の個数
bool b=a.contains(x); //xを含む
- -------- 比較関数prでsort済みの配列用 --------
auto pr=[&](auto &x,auto &y){ return x>y; }; //降順ソート時
ll i=a.flooridx(x,pr);   //x以左の最近傍位置i ない時-1
ll i=a.ceilidx(x,pr);    //x以右の最近傍位置i ない時N(配列長)
ll m=a.leftnmof(x,pr);   //x以左の個数
ll m=a.rightnmof(x,pr);  //x以右の個数
bool b=a.contains(x,pr); //xを含む

a.concat(b,n).pop_back().rsort().uniq();  //連続適用できる
*/


namespace SolvingSpace{

template<class T> using vector = Vector<T>;
using    vll=vector<   ll>; using    vmll=vector<   mll>; using   vdd=vector<  dd>;
using   vvll=vector<  vll>; using   vvmll=vector<  vmll>; using  vvdd=vector< vdd>;
using  vvvll=vector< vvll>; using  vvvmll=vector< vvmll>; using vvvdd=vector<vvdd>;
using vvvvll=vector<vvvll>; using vvvvmll=vector<vvvmll>;
using   vpll=vector<  pll>; using    vtll=vector<   tll>; using  vqll=vector< qll>;
using  vvpll=vector< vpll>; using   vvtll=vector<  vtll>; using vvqll=vector<vqll>;
using vss=vector<string>;
template<class T> vector<T> cinv(ll nm){ return vector<T>(nm,[](ll i){ (void)i; return cin1<T>(); }); }
template<class T> vector<vector<T>> cinvv(ll H,ll W){ return vector<vector<T>>(H,[&](ll i){ (void)i; return cinv<T>(W); }); }


template<class S> struct treapnode{
	void *lch_ = nullptr,*rch_ = nullptr; //子node
	int pri_=0; //優先度
	int cnt_=1; //部分木サイズ
	S data_=S();
	treapnode(){}
	treapnode(int priority,const S &data): pri_(priority),data_(data){}
	void init(int priority,const S &data){ pri_=priority,data_=data; }
	treapnode *lch()const{ return static_cast<treapnode*>(lch_); }
	treapnode *rch()const{ return static_cast<treapnode*>(rch_); }
	S &data(){ return data_; }
	int cnt()const{ return cnt_; }
	int pri()const{ return pri_; }
	int cntL()const{ return lch() ? lch()->cnt() : 0; }
	int cntR()const{ return rch() ? rch()->cnt() : 0; }
	void update_cnt(){ cnt_=cntL()+cntR()+1; }
	void pushup(){ update_cnt(); }
	void pushdown(){}
	using data_type = S;
};

template<class Node> struct treap{
	using Int = long long;
	using S = typename Node::data_type;
	Node *root = nullptr;
	/*---- utility ----*/
	vector<Node> nodePool; //nodeの実体プール 一度確保したら再確保しないよう注意
	int nodePoolUsed=0; //nodeの実体使用数
	Node *newNode(const S &data){ //新規nodeをpoolから生成 poolになければnew
		if (nodePoolUsed >= (int)nodePool.size()) return new Node(newPri(),data);
		Node *v = &nodePool[nodePoolUsed++];
		v->init(newPri(),data);
		return v;
	}
	int newPri(int s=-1){ //線形合同法で0~2^31-1の乱数を発生
		static int x = (s!=-1) ? s :
			(int)chrono::system_clock::now().time_since_epoch().count();
		return x=(1103515245*x+12345)&0x7fffffff;
	}
	Node *merge(Node *a,Node *b){ //aの右にbを結合
		if (!a || !b) return a ? a : b;
		Node *ret;
		if (a->pri() > b->pri()) a->pushdown(),a->rch_=merge(a->rch(),b),ret=a;
		else                     b->pushdown(),b->lch_=merge(a,b->lch()),ret=b;
		ret->pushup();
		return ret;
	}
	Node *merge3(Node *l,Node *m,Node *r){ return merge(l,merge(m,r)); }
	Node *merge4(Node *l,Node *m,Node *n,Node *r){ return merge(l,merge3(m,n,r)); }
	//添字idxで分割  upper=false:idx未満と以上に分割、true:idx以下と超に分割
	pair<Node*,Node*> split(Node *nd,int idx,bool upper=false){
		if (!nd) return {nullptr,nullptr};
		nd->pushdown();
		if (nd->cntL()<idx || (upper && nd->cntL()==idx)){ //現nodeを左へ
			auto [ltree,rtree]=split(nd->rch(),idx-nd->cntL()-1);
			nd->rch_=ltree;
			nd->pushup();
			return {nd,rtree};
		}
		else{ //現nodeを右へ
			auto [ltree,rtree]=split(nd->lch(),idx);
			nd->lch_=rtree;
			nd->pushup();
			return {ltree,nd};
		}
	}
	tuple<Node*,Node*,Node*> split3(Node *nd,int i,int j){//3分割[0,i),[i,j),[j,)
		auto [lmtree,rtree]=split(nd,j);
		auto [ltree,mtree]=split(lmtree,i);
		return {ltree,mtree,rtree};
	}
	tuple<Node*,Node*,Node*,Node*> split4(Node *nd,int i,int j,int k){//4分割
		auto [tree012,tree3]=split(nd,k);
		auto [tree0,tree1,tree2]=split3(tree012,i,j);
		return {tree0,tree1,tree2,tree3};
	}
	void dump(Node *v,ll p)const{
		if (!v)return;
		dump(v->lch(),-abs(p)-1);
		cout << string(4*abs(p),' ') << ((p<0) ? "/- " : "`- ") << v->data() << '\n';
		dump(v->rch(),abs(p)+1);
	}
	/*-------- I/F --------*/
	treap(Int mxNd=0,Int seed=-1){ init(mxNd,seed); }
	treap(const vector<S> &ini,Int mxNd=0,Int seed=-1){ init(ini,mxNd,seed); }
	void init(Int mxNd=0,Int seed=-1){
		if (mxNd>0) nodePool.resize(mxNd);
		if (seed!=-1) newPri((int)seed);
	}
	void init(const vector<S> &ini,Int mxNd=0,Int seed=-1){
		init(mxNd,seed);
		for (const S &data: ini) push_back(data);
	}
	bool empty()const{ return !root; }
	Int size()const{ return root ? (Int)root->cnt() : 0; }
	S operator[](Int i)const{
		assert(0<=i && i<size());
		Node *v=root;
		while (v && v->cntL()!=i){
			if (v->cntL()<i) i-=v->cntL()+1,v=v->rch();
			else v=v->lch();
		}
		return v->data();
	}
	void insert(Int idx,const S &data){//ndをtreeの位置idxに挿入
		static vector<Node*> bf;
		Node *nd=newNode(data);
		int i=(int)idx;
		//優先度が低くなるまで下る
		//v:ndよりpri小のサブ木, pv:vの格納場所(lch等), bf:ndよりpri大の祖先列
		Node **pv=&root,*v=root;
		while (v && v->pri()>=nd->pri()){
			bf.push_back(v);
			v->pushdown();
			if (v->cntL()<i) i-=v->cntL()+1,pv=(Node**)&(v->rch_);
			else pv=(Node**)&(v->lch_);
			v=*pv;
		}
		//優先度低のサブ木vを分割して左右の子にする
		auto [ltree,rtree]=split(v,i);
		*pv=merge3(ltree,nd,rtree);
		//祖先列を下から順にpushup
		while (!bf.empty()) bf.back()->pushup(),bf.pop_back();
	}
	void erase(Int idx){
		assert(0<=idx && idx<size());
		auto [ltree,mtree,rtree]=split3(root,(int)idx,(int)idx+1);
		root=merge(ltree,rtree);
	}
	void push_back(const S &data){ insert(size(),data); }
	void rotate(Int l,Int r,Int m){ //[l,r]をmがlになるようrotate
		auto [t0,t1,t2,t3]=split4(root,(int)l,(int)m,(int)r+1);
		root=merge4(t0,t2,t1,t3); //root再代入、pri同点で変わる可能性を考慮
	}
	void dump()const{ dump(root,0); }
};
/*
- iniで初期化       vll等↓ ↓ノードmxNd個予め確保
treap<treapnode<ll>> tr(ini,mxNd);
- 空で初期化 予め確保無
treap<treapnode<ll>> tr;
- 各種操作
bool b=tr.empty();
ll n=tr.size();
ll x=tr[i];
tr.push_back(x); //末尾にx挿入
tr.insert(i,x);  //位置iにxを挿入
tr.erase(i);     //位置iを削除
*/


struct coordinateCompression{
	using Int = long long;
	vector<Int> idx2val;
	coordinateCompression(){}
	coordinateCompression(vector<Int> &vs){ add(vs),compress(),v2i(vs); }
	void add(Int val){ idx2val.push_back(val); }
	void add(const vector<Int> &vs){ for (auto&& e:vs) idx2val.push_back(e); }
	void compress(){
		sort(idx2val.begin(),idx2val.end());
		idx2val.erase(unique(idx2val.begin(),idx2val.end()),idx2val.end());
	}
	Int size(){ return (Int)idx2val.size(); }
	Int i2v(Int i){ return idx2val[i]; }
	Int v2i(Int v){
		return lower_bound(idx2val.begin(),idx2val.end(),v)-idx2val.begin();
	}
	void v2i(vector<Int> &vs){ for (auto&& e: vs) e=v2i(e); }//vsを置換え
	Int v2flooridx(Int v){
		return upper_bound(idx2val.begin(),idx2val.end(),v)-idx2val.begin()-1;
	}
	Int v2ceilidx(Int v){
		return lower_bound(idx2val.begin(),idx2val.end(),v)-idx2val.begin();
	}
	bool contains(Int v){
		auto it=lower_bound(idx2val.begin(),idx2val.end(),v);
		return it!=idx2val.end() && *it==v;
	}
};
/*
coordinateCompression co;
coordinateCompression co(vs);
.                        ↑vsを追加&圧縮&置換
- -------- データ追加 --------   1要素でも、vector丸ごとでも可
co.add(x);
co.add(vs);
- -------- 圧縮 --------
co.compress();
- -------- 利用 --------
ll m=co.size(); //圧縮後のデータ数
ll x=co.i2v(i);        //圧縮後iの圧縮前の値x
ll i=co.v2i(x);        //圧縮前xの圧縮後の値i
co.v2i(vs);       //vsの全vをiに置換
ll i=co.v2flooridx(x); //        〃       (ぴったりxがなければ小さい方)
ll i=co.v2ceilidx(x);  //        〃       (ぴったりxがなければ大きい方)
bool b=co.contains(x); //true:xが圧縮前データに含まれる
*/


template <class T> struct BIT_{
	vector<T> v; ll N;
	BIT_(){}
	BIT_(ll N) { init(N); }
	void init(ll N) { v.resize(N+1); this->N = N; }
	void add(ll i,T x) { for (i++; i<=N; i+=i&(-i)) v[i]+=x; }
	T sum(ll i) { if (i>=N)i=N-1; T s=0;  for (i++; i>0; i-=i&(-i)) s+=v[i];  return s; }
	T sum(ll i,ll j) { return sum(j)-sum(i-1); }
	T sum() { return sum(N-1); } //総和
	T operator[](ll i) { return sum(i,i); }
	ll lower_bound(T s){
		ll i=0,l=1;  while (l<N) l<<=1;
		for (; l>0; l>>=1) if (i+l<=N && v[i+l]<s) s-=v[i+=l];
		return i;
	}
	void Dump() { rep(i,0,N-1) cerr<<setw(3)<< i <<" "<<setw(5)<< sum(i,i) <<'\n'; }
	/*---- 集合管理用I/F ----*/
	ll size() { return sum(); } //要素数
	void insert(ll x) { add(x,1); }//集合にx追加
	void erase(ll x) { add(x,-1); }//集合からx1つ削除
	bool contains(ll x) { return (0<=x&&x<N) ? (*this)[x]>=1 : false; }//x∈集合ならtrue
	ll rank(ll x) { return sum(x-1)+1; }//xが小さい方から何番目か 1-origin
	ll rrank(ll x) { return sum(x+1,N-1)+1; }//xが大きい方から何番目か 1-origin
	ll leftnumof(ll x) { return sum(x); }//x以下の個数
	ll rightnumof(ll x) { return sum(x,N-1); }//x以上の個数
	ll nthsmall(ll r) { return lower_bound(r); } //r番目に小さい要素 1-origin
	ll nthbig(ll r) { return (size()<r) ? -1 : nthsmall(size()+1-r); }
												 //r番目に大きい要素 1-origin
	/*---- 動的imos用I/F ----*/
	void rangeadd(ll l,ll r,T x){ add(l,x),add(r+1,-x); }//[l,r]にx加算
	T imos(ll i){ return sum(i); }//加算後の第i要素
};
using BIT = BIT_<ll>;
/*
BIT bit(n); //準備 0~n-1
ll nm=bit.size(); //集合の要素数
bit.insert(x); //集合にxを挿入
bit.erase(x);  //集合からxを1つ削除
bool b=bit.contains(x); //x∈集合ならtrue
ll r = bit.rank(x);  //xが小さい方から何番目か 1-origin
ll r = bit.rrank(x); //xが大きい方から何番目か 1-origin
ll nm=bit.leftnumof(x);  //x以下の個数
ll nm=bit.rightnumof(x); //x以上の個数
ll nm=bit[x];            //xの個数
ll x=bit.nthsmall(r); //r番目に小さい要素 1-origin ない時はN
ll x=bit.nthbig(r);   //r番目に大きい要素 1-origin ない時は-1
--- 動的imos用I/F ---
bit.rangeadd(l,r,x); //区間[l,r]に+x
ll x=bit.imos(i); //第i要素の値
*/


void cin2solve()
{
	auto [N,Q]=cins<ll,ll>();
	auto A=cinv<ll>(N);
	vtll kkx;

	coordinateCompression co;
	co.add(A);

	rep(q,0,Q-1){
		auto ki=cin1<ll>();
		if (ki==1){
			auto [k,x]=cins<ll,ll>();
			kkx.emplace_back(ki,k-1,x);
			co.add(x);
		}
		else if (ki==2){
			kkx.emplace_back(ki,0,0);
		}
		else{
			auto k=cin1<ll>();
			kkx.emplace_back(ki,k-1,0);
		}
	}

	co.compress();
	for (auto&& a: A) a=co.v2i(a);
	for (auto&&[ki,k,x]:kkx){
		if (ki==1) x=co.v2i(x);
	}

	BIT bit(co.size()); //準備 0~n-1

	vll ans;

	ll i=0;
	for (;i<Q;++i){
		auto [ki,k,x]=kkx[i];
		if (ki==1){
			A[k]=x;
		}
		else if (ki==2){
			++i;
			break;
		}
		else{
			ans.push_back(A[k]);
		}
	}

	A.sort();
	ll mxNd=1000000;
	treap<treapnode<ll>> tr(A,mxNd);

	vll poss;
	vll vas;

	for (;i<Q;++i){
		auto [ki,k,x]=kkx[i];
		if (ki==1){
			ll va=tr[k];
			tr.erase(k);
			tr.insert(k,x);
			bit.erase(va);
			bit.insert(x);
			poss.push_back(k);
		}
		else if (ki==2){
			poss.sortq();
			poss.reverse();
			for (auto&& pos: poss) vas.push_back(tr[pos]);
			for (auto&& pos: poss) tr.erase(pos);
			vas.sort();
			for (auto&& va: vas){
				ll r = bit.rank(va)-1;  //vaが小さい方から何番目か 1-origin
				tr.insert(r,va);
			}
			poss.clear();
			vas.clear();
		}
		else{
			ans.push_back(tr[k]);
		}
	}

	each(e,ans) cout << co.i2v(e) << '\n';

	return;
}

};//SolvingSpace

//////////////////////////////////////////

int main(){
#if 1
	//SolvingSpace::labo();
	SolvingSpace::cin2solve();
  //SolvingSpace::generand();
#else
	ll t;  cin >> t;
	rep(i,0,t-1){
		SolvingSpace::cin2solve();
		//SolvingSpace::generand();
	} 
#endif
	cerr << timeget() <<"ms"<< '\n';
	return 0;
}
yukicoder

結果

テストケース

ソースコード
