#include // #include #define int long long #define inf 1000000007 #define pa pair #define ll long long #define pal pair #define ppap pair #define PI 3.14159265358979323846 #define paa pair #define mp make_pair #define pb push_back #define EPS (1e-8) int dx[8]={0,1,0,-1,1,1,-1,-1}; int dy[8]={1,0,-1,0,-1,1,1,-1}; using namespace std; class pa3{ public: int x; int y,z; pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {} bool operator < (const pa3 &p) const{ if(x!=p.x) return x (const pa3 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; return z>p.z; //return x != p.x ? x (const pa4 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; if(z!=p.z)return z>p.z; return w>p.w; //return x != p.x ? x (const pa2 &p) const{ return x != p.x ? xb) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } int mod; int extgcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1; y = 0; return a; } int d = extgcd(b, a%b, y, x); y -= a/b * x; return d; } pa operator+(const pa & l,const pa & r) { return {l.first+r.first,l.second+r.second}; } pa operator-(const pa & l,const pa & r) { return {l.first-r.first,l.second-r.second}; } int pr[1000010]; int inv[1000010]; int beki(int wa,int rr,int warukazu){ if(rr==0) return 1%warukazu; if(rr==1) return wa%warukazu; wa%=warukazu; if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu; ll zx=beki(wa,rr/2,warukazu); return (zx*zx)%warukazu; } int comb(int nn,int rr){ if(rr<0 || rr>nn || nn<0) return 0; int r=pr[nn]*inv[rr]; r%=mod; r*=inv[nn-rr]; r%=mod; return r; } void gya(int ert){ pr[0]=1; for(int i=1;i<=ert;i++){ pr[i]=(pr[i-1]*i)%mod; } inv[ert]=beki(pr[ert],mod-2,mod); for(int i=ert-1;i>=0;i--){ inv[i]=inv[i+1]*(i+1)%mod; } } // cin.tie(0); // ios::sync_with_stdio(false); //priority_queue,greater> pq; //sort(ve.begin(),ve.end(),greater()); // mt19937(clock_per_sec); // mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ; //----------------kokomade tenpure------------ struct Segmin{ // 1 // 2 3 // 4 5 6 7 private: public: // (1<<15)=32768 // 1<<16 = 65536 // 1<<17 = 131072 // 1<<18 = 262144 int cor=(1<<17); vector vec; void shoki1(){ vec.resize(2*cor+3, mp(0,0)); for(int i=cor;i<2*cor;i++)vec[i].second=i-cor; } void shoki2(){ for(int i=cor-1;i>0;i--) { if(vec[2*i].first<=vec[2*i+1].first) vec[i]=vec[2*i]; else vec[i]=vec[2*i+1]; } } void updadd(int x,int w){ //x 項目に w加算 x+=cor; vec[x].first+=w; while(1){ x/=2; if(x==0) break; if(vec[2*x].first<=vec[2*x+1].first) vec[x]=vec[2*x]; else vec[x]=vec[2*x+1]; } } void updchan(int x,int w){ //x項目をwに変更 x+=cor; vec[x].first=w; while(1){ x/=2; if(x==0) break; if(vec[2*x].first<=vec[2*x+1].first) vec[x]=vec[2*x]; else vec[x]=vec[2*x+1]; } } // [a,b) // k-th node // k no kukanha [l,r) pa segmin(int a,int b,int k=1,int l=0,int r=-10){ if(r<0)r=cor; // cout<>n>>q; ss.shoki1(); for(int i=1;i<=n;i++){ int y; cin>>y; ss.vec[ss.cor+i].first=y; } ss.shoki2(); for(int i=0;i>t; int l,r; cin>>l>>r; if(t==1){ int x=ss.vec[ss.cor+l].first; int y=ss.vec[ss.cor+r].first; ss.updchan(l,y); ss.updchan(r,x); } else{ cout<