Problem: Write a program which reads a sequence of integers $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and reverse specified elements by a list of the following operation:

* reverse($b, e$): reverse the order of $a_b, a_{b+1}, ..., a_{e-1}$

Constraints

* $1 \leq n \leq 1,000$
* $-1,000,000,000 \leq a_i \leq 1,000,000,000$
* $1 \leq q \leq 1,000$
* $0 \leq b < e \leq n$

Input

The input is given in the following format.


$n$
$a_0 \; a_1 \; ...,\; a_{n-1}$
$q$
$b_1 \; e_1$
$b_2 \; e_2$
:
$b_{q} \; b_{q}$


In the first line, $n$ (the number of elements in $A$) is given. In the second line, $a_i$ (each element in $A$) are given. In the third line, the number of queries $q$ is given and each query is given by two integers $b_i \; e_i$ in the following $q$ lines.

Output

Print all elements of $A$ in a line after performing the given operations. Put a single space character between adjacency elements and a newline at the end of the last element.

Example

Input

8
1 2 3 4 5 6 7 8
2
1 6
3 8


Output

1 6 5 8 7 2 3 4

Solution (in CPP):

Solution:
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;


int main(){
  long ii,jj,kk;
  vector<int> ret;

  int n,q;
  vector<int> a;
  vector<int> swap;
  cin >> n;
  
  a.resize(n);
  swap.resize(n);
  for(ii=0;ii<n;ii++){
    cin >> a[ii];
  }

  cin >> q;

  int b,e;

  for(ii=0;ii<q;ii++){

    cin >> b >> e;
    //cout << "b:" << b << "e:" << e << endl;
    for(jj=b;jj<e;jj++){
      swap[jj] = a[b+e-jj-1];
    }
    
    for(jj=b;jj<e;jj++){
      //cout << swap[jj] << " " ;
      a[jj] = swap[jj];
    }
    
    //cout << endl;
    
  }

  for(ii=0;ii<n;ii++){
    if(ii != n-1){
      cout << a[ii] << " ";
    }
    else{
      cout << a[ii];
    }
  }
  cout << endl;
  return 0;
}