#include <bits/stdc++.h>
using namespace std;
int modpow(int a, int b, int m) {
  int c = 1;
  while (b) {
    if (b & 1) c = (c * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return c;
}
int arr[300005], dp[300005][21], dp1[300005][21], INF;
int main() {
  int n, q, i, j, k, u, v, mask;
  cin >> n >> q;
  INF = n + 1;
  for (i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (i = 1; i <= n + 1; i++)
    for (j = 0; j < 21; j++) dp[i][j] = dp1[i][j] = INF;
  for (i = n; i > 0; i--) {
    for (j = 0; j < 21; j++) {
      mask = 1 << j;
      dp1[i][j] = dp1[i + 1][j];
      if (mask & arr[i]) {
        u = dp1[i][j];
        dp[i][j] = u;
        if (u != INF) {
          for (k = 0; k < 21; k++) {
            dp[i][k] = min(dp[u][k], dp[i][k]);
          }
        }
        dp1[i][j] = i;
      }
    }
  }
  while (q--) {
    cin >> u >> v;
    for (i = 0; i < 21; i++) {
      mask = (1 << i);
      if ((mask & arr[v]) && (dp[u][i] <= v)) {
        cout << "Shi\n";
        break;
      }
    }
    if (i == 21) cout << "Fou\n";
  }
  return 0;
}
