func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mod = 1e9 + 7;   struct fastio {     char s[100000];     int it, len;     fastio() { it = len = 0; }     inline char get() {       if (it < len) return s[it++];       it = 0;       len = fread(s, 1, 100000, stdin);       if (len == 0)         return EOF;       else         return s[it++];     }     bool notend() {       char c = get();       while (c ==     || c ==   n ) c = get();       if (it > 0) it--;       return c != EOF;     }   } _buff;   inline long long getnum() {     long long r = 0;     bool ng = 0;     char c;     c = _buff.get();     while (c !=  -  && (c <  0  || c >  9 )) c = _buff.get();     if (c ==  - ) ng = 1, c = _buff.get();     while (c >=  0  && c <=  9 ) r = r * 10 + c -  0 , c = _buff.get();     return ng ? -r : r;   }   template <class T>   inline void putnum(T x) {     if (x < 0) putchar( - ), x = -x;     register short a[20] = {}, sz = 0;     while (x) a[sz++] = x % 10, x /= 10;     if (sz == 0) putchar( 0 );     for (int i = sz - 1; i >= 0; i--) putchar( 0  + a[i]);   }   inline char getreal() {     char c = _buff.get();     while (c <= 32) c = _buff.get();     return c;   }   long long qpow(long long x, long long k) {     return k == 0 ? 1                   : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;   }   const int maxn = 300111;   int n, q;   int a[maxn];   void makev(vector<pair<int, int> > &v) {     sort(v.begin(), v.end());     int c = 0;     vector<pair<int, int> > nv;     for (auto x : v) {       if ((c | x.second) > c) {         c = c | x.second;         nv.push_back(make_pair(x.first, c));       }     }     v = nv;   }   vector<pair<int, int> > v[maxn];   int lst[20];   int main() {     n = getnum(), q = getnum();     for (int i = 1; i <= n; i++) a[i] = getnum();     for (int i = n; i >= 1; i--) {       vector<pair<int, int> > &cur = v[i];       cur.push_back(make_pair(i, a[i]));       for (int j = 0; j < 20; j++) {         if ((a[i] >> j) & 1) {           if (lst[j]) {             for (auto x : v[lst[j]]) cur.push_back(x);           }           lst[j] = i;         }       }       makev(cur);     }     for (int i = 1; i <= q; i++) {       int x, y;       x = getnum(), y = getnum();       bool ok = false;       for (auto t : v[x]) {         ok |= t.first <= y && ((t.second & a[y]) > 0);       }       puts(ok ?  Shi  :  Fou );     }     return 0;   }   