#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 using namespace std;

 const int maxn =  + ;

 const int maxnode = (maxn << );

 const int INF = 0x3f3f3f3f;

 void scan(int& x)

 {

     x = ;

     char c = ' ';

     while(c < '' || c > '') c = getchar();

     while(c >= '' && c <= '') { x = x *  + c - ''; c = getchar(); }

 }

 int qL, qR;

 int p, v;

 int n, Q;

 int minv[maxnode];

 int a[maxn];

 void build(int o, int L, int R)

 {

     if(L == R) { scan(a[L]); minv[o] = a[L]; return ; }

     int M = (L + R) / ;

     build(o<<, L, M);

     build(o<<|, M+, R);

     minv[o] = min(minv[o<<], minv[o<<|]);

 }

 void update(int o, int L, int R)

 {

     //if(v >= minv[o]) return ;

     if(L == R) { minv[o] = v; return ; }

     int M = (L + R) / ;

     if(p <= M) update(o<<, L, M);

     else update(o<<|, M+, R);

     minv[o] = min(minv[o<<], minv[o<<|]);

 }

 int query(int o, int L, int R)

 {

     if(qL <= L && R <= qR) return minv[o];

     int ans = INF;

     int M = (L + R) / ;

     if(qL <= M) ans = min(ans, query(o<<, L, M));

     if(qR > M) ans = min(ans, query(o<<|, M+, R));

     return ans;

 }

 char op[];

 int main()

 {

     while(scanf("%d%d", &n, &Q) ==  && n)

     {

         build(, , n);

         while(Q--)

         {

             scanf("%s", op);

             int l = strlen(op);

             if(op[] == 'q')

             {

                 int i = ;

                 qL = ;

                 while(i < l && op[i] >= '' && op[i] <= '') { qL = qL *  + op[i] - ''; i++; }

                 while(i < l && (op[i] < '' || op[i] > '')) i++;

                 qR = ;

                 while(i < l && op[i] >= '' && op[i] <= '') { qR = qR *  + op[i] - ''; i++; }

                 printf("%d\n", query(, , n));

             }

             else

             {

                 vector<int> hehe;

                 for(int i = ; i < l;)

                 {

                     while(i < l && (op[i] < '' || op[i] > '')) i++;

                     if(i >= l) break;

                     int x = ;

                     while(i < l && op[i] >= '' && op[i] <= '') { x = x *  + op[i] - ''; i++; }

                     hehe.push_back(x);

                 }

                 int sz = hehe.size();

                 for(int i = ; i < sz - ; i++)

                 {

                     v = a[hehe[i + ]];

                     p = hehe[i];

                     update(, , n);

                 }

                 v = a[hehe[]];

                 p = hehe[sz - ];

                 update(, , n);

                 int t = a[hehe[]];

                 for(int i = ; i < sz - ; i++) a[hehe[i]] = a[hehe[i+]];

                 a[hehe[sz - ]] = t;

             }

         }

     }

     return ;

 }