#include<bits/stdc++.h>
using namespace std;
#define MAX 300005
#define SZ 500
#define INF (1000000007)
typedef pair<int,int> P;
int a[MAX];
int A[MAX];
int b[MAX];
int B[MAX];
vector< P > ma,mb,mA,mB;

void update(int a[MAX],int A[MAX],vector< P > &ma,vector< P > &mA,int i,int x){
  int I=i/SZ;

  ma.push_back( P(i,a[i]) );
  a[i]=x;
  ma.push_back( P(i,a[i]) );
  
  int mini=INF;
  for(int i=0;i<SZ;i++){
    mini=min(mini, a[ I*SZ + i ] );
  }

  mA.push_back( P(I,A[I]) );
  A[I]=mini;
  mA.push_back( P(I,A[I]) );
}

int query(int a[MAX],int A[MAX],int l,int r){
  int res=INF;
  int i=l;
  while(i<r){
    if(i%SZ==0 && i+SZ <= r){
      res=min(res,A[i/SZ]);
      i+=SZ;
    }else{
      res=min(res,a[i]);
      i++;
    }
  }
  return res;
}


void q5(){
  reverse(ma.begin(),ma.end());
  for(int i=0;i<(int)ma.size();i++){
    P p=ma[i];
    a[ p.first ] = p.second;
  }
  reverse(mA.begin(),mA.end());
  for(int i=0;i<(int)mA.size();i++){
    P p=mA[i];
    A[ p.first ] = p.second;
  }
  
  for(int i=0;i<(int)mb.size();i++){
    P p=mb[i];
    a[ p.first ] = p.second;
  }
  for(int i=0;i<(int)mB.size();i++){
    P p=mB[i];
    A[ p.first ] = p.second;
  }
  
  ma.clear();
  mA.clear();
  mb.clear();
  mB.clear();
}

void q6(){
  reverse(mb.begin(),mb.end());
  for(int i=0;i<(int)mb.size();i++){
    P p=mb[i];
    b[ p.first ] = p.second;
  }
  reverse(mB.begin(),mB.end());
  for(int i=0;i<(int)mB.size();i++){
    P p=mB[i];
    B[ p.first ] = p.second;
  }
  
  for(int i=0;i<(int)ma.size();i++){
    P p=ma[i];
    b[ p.first ] = p.second;
  }
  for(int i=0;i<(int)mA.size();i++){
    P p=mA[i];
    B[ p.first ] = p.second;
  }
  
  ma.clear();
  mA.clear();
  mb.clear();
  mB.clear();
}
int N,Q;

int main(){
  scanf("%d",&N);
  
  for(int i=0;i<N;i++){
    int x;
    scanf("%d",&x);
    update(a,A,ma,mA,i,x);
  }
  
  for(int i=0;i<N;i++){
    int x;
    scanf("%d",&x);
    update(b,B,mb,mB,i,x);
  }

  scanf("%d",&Q);
  while(Q--){
    int x,y,z;
    scanf("%d %d %d",&x,&y,&z);
    if(x==1){
      update(a,A,ma,mA,y-1,z);
    }
    if(x==2){
      update(b,B,mb,mB,y-1,z);
    }
    if(x==3){
      printf("%d\n", query(a,A,y-1,z) );
    }
    if(x==4){
      printf("%d\n", query(b,B,y-1,z) );
    }
    if(x==5){
      q5();
    }
    if(x==6){
      q6();
    }
  }
  return 0;
}
### Prompt

Create a solution in Cpp for the following problem:

Problem

Given two sequences of length $ N $, $ A $ and $ B $. First, the $ i $ item in the sequence $ A $ is $ a_i $, and the $ i $ item in the sequence $ B $ is $ b_i $.

Since a total of $ Q $ of statements of the following format are given, create a program that processes in the given order.

Each statement is represented by three integers $ x, y, z $.

* Set the value of the $ y $ item in the sequence $ A $ to $ z $. (When $ x = 1 $)
* Set the value of the $ y $ item in the sequence $ B $ to $ z $. (When $ x = 2 $)
* Find and report the smallest value in the $ z $ item from the $ y $ item in the sequence $ A $. (When $ x = 3 $)
* Find and report the smallest value in the $ z $ item from the $ y $ item in the sequence $ B $. (When $ x = 4 $)
* Change the sequence $ A $ to be exactly the same as the sequence $ B $. (When $ x = 5 $)
* Change the sequence $ B $ to be exactly the same as the sequence $ A $. (When $ x = 6 $)

Constraints

The input satisfies the following conditions.

* $ 2 \ le N \ le 2 \ times 10 ^ 5 $
* $ 2 \ le Q \ le 2 \ times 10 ^ 5 $
* $ 1 \ le a_i \ le 10 ^ 9 $
* $ 1 \ le b_i \ le 10 ^ 9 $
* $ 1 \ le x_i \ le 6 $
* $ 1 \ le y_i \ le N $ (when $ 1 \ le x_i \ le 4 $)
* $ y_i = -1 $ (when $ x_i = 5, 6 $)
* $ 1 \ le z_i \ le 10 ^ 9 $ (when $ x_i = 1, 2 $)
* $ y_i \ le z_i \ le N $ (when $ x_i = 3, 4 $)
* $ z_i = -1 $ (when $ x_i = 5, 6 $)
* All inputs are integers

Input

The input is given in the following format.

$ N $
$ a_ {1} $ $ a_ {2} $ ... $ a_ {N} $
$ b_ {1} $ $ b_ {2} $ ... $ b_ {N} $
$ Q $
$ x_1 $ $ y_1 $ $ z_1 $
$ x_2 $ $ y_2 $ $ z_2 $
...
$ x_Q $ $ y_Q $ $ z_Q $

Output

Every time a statement of $ x = 3 $ or $ x = 4 $ is given by input, the found value is output on one line.

Example

Input

5
1 3 5 7 9
6 2 3 2 6
10
1 3 4
3 4 5
4 2 3
5 -1 -1
2 3 8
3 2 5
4 3 3
1 1 1
6 -1 -1
3 1 5


Output

7
2
2
8
1

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
#define MAX 300005
#define SZ 500
#define INF (1000000007)
typedef pair<int,int> P;
int a[MAX];
int A[MAX];
int b[MAX];
int B[MAX];
vector< P > ma,mb,mA,mB;

void update(int a[MAX],int A[MAX],vector< P > &ma,vector< P > &mA,int i,int x){
  int I=i/SZ;

  ma.push_back( P(i,a[i]) );
  a[i]=x;
  ma.push_back( P(i,a[i]) );
  
  int mini=INF;
  for(int i=0;i<SZ;i++){
    mini=min(mini, a[ I*SZ + i ] );
  }

  mA.push_back( P(I,A[I]) );
  A[I]=mini;
  mA.push_back( P(I,A[I]) );
}

int query(int a[MAX],int A[MAX],int l,int r){
  int res=INF;
  int i=l;
  while(i<r){
    if(i%SZ==0 && i+SZ <= r){
      res=min(res,A[i/SZ]);
      i+=SZ;
    }else{
      res=min(res,a[i]);
      i++;
    }
  }
  return res;
}


void q5(){
  reverse(ma.begin(),ma.end());
  for(int i=0;i<(int)ma.size();i++){
    P p=ma[i];
    a[ p.first ] = p.second;
  }
  reverse(mA.begin(),mA.end());
  for(int i=0;i<(int)mA.size();i++){
    P p=mA[i];
    A[ p.first ] = p.second;
  }
  
  for(int i=0;i<(int)mb.size();i++){
    P p=mb[i];
    a[ p.first ] = p.second;
  }
  for(int i=0;i<(int)mB.size();i++){
    P p=mB[i];
    A[ p.first ] = p.second;
  }
  
  ma.clear();
  mA.clear();
  mb.clear();
  mB.clear();
}

void q6(){
  reverse(mb.begin(),mb.end());
  for(int i=0;i<(int)mb.size();i++){
    P p=mb[i];
    b[ p.first ] = p.second;
  }
  reverse(mB.begin(),mB.end());
  for(int i=0;i<(int)mB.size();i++){
    P p=mB[i];
    B[ p.first ] = p.second;
  }
  
  for(int i=0;i<(int)ma.size();i++){
    P p=ma[i];
    b[ p.first ] = p.second;
  }
  for(int i=0;i<(int)mA.size();i++){
    P p=mA[i];
    B[ p.first ] = p.second;
  }
  
  ma.clear();
  mA.clear();
  mb.clear();
  mB.clear();
}
int N,Q;

int main(){
  scanf("%d",&N);
  
  for(int i=0;i<N;i++){
    int x;
    scanf("%d",&x);
    update(a,A,ma,mA,i,x);
  }
  
  for(int i=0;i<N;i++){
    int x;
    scanf("%d",&x);
    update(b,B,mb,mB,i,x);
  }

  scanf("%d",&Q);
  while(Q--){
    int x,y,z;
    scanf("%d %d %d",&x,&y,&z);
    if(x==1){
      update(a,A,ma,mA,y-1,z);
    }
    if(x==2){
      update(b,B,mb,mB,y-1,z);
    }
    if(x==3){
      printf("%d\n", query(a,A,y-1,z) );
    }
    if(x==4){
      printf("%d\n", query(b,B,y-1,z) );
    }
    if(x==5){
      q5();
    }
    if(x==6){
      q6();
    }
  }
  return 0;
}
```