#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long N = 4e5 + 10;
const long long big = 1e14;
const long long block = 500;
const long long mod = 1e9 + 7;
long long n, q;
long long a[N];
long long tin[N], tout[N];
long long lbit[32][32];
long long g[N][32];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i <= 20; i++)
    for (int j = 0; j <= 20; j++) lbit[i][j] = big;
  for (int i = n; i >= 1; i--) {
    vector<long long> u;
    for (int j = 0; j <= 20; j++) {
      g[i][j] = big;
      if ((1ll << j) & a[i]) u.push_back(j);
    }
    for (auto v : u) {
      for (auto v1 : u) lbit[v][v1] = i;
    }
    for (int j = 0; j <= 20; j++) {
      if ((1 << j) & a[i]) {
        for (int h = 0; h <= 20; h++) {
          if (lbit[j][h]) g[i][h] = min(g[i][h], lbit[j][h]);
        }
      }
    }
    for (int j = 0; j <= 20; j++) {
      if ((1 << j) & a[i]) {
        for (int l = 0; l <= 20; l++) lbit[j][l] = min(lbit[j][l], g[i][l]);
      }
    }
  }
  while (q--) {
    long long c, b;
    cin >> c >> b;
    bool asn = 1;
    for (int i = 0; i <= 20; i++) {
      if (((1 << i) & a[b]) && g[c][i] <= b) {
        cout << "Shi\n";
        asn = 0;
        break;
      }
    }
    if (asn) cout << "Fou\n";
  }
}
