#include <bits/stdc++.h>
using namespace std;
int n;
int a[300000 + 1];
int dp[300000 + 1][19];
int last[300000 + 1][19];
void preprocess() {
  for (int b = 0; b < 19; b++) {
    int lastAux = n;
    for (int i = n - 1; i >= 0; i--) {
      if ((a[i] & (1 << b)) == 0) {
        last[i][b] = n;
        continue;
      }
      last[i][b] = (lastAux == n) ? i : lastAux;
      lastAux = i;
    }
  }
  for (int k = 0; k < 19; k++) {
    dp[n][k] = n;
    dp[n - 1][k] = last[n - 1][k];
    for (int i = n - 2; i >= 0; i--) {
      dp[i][k] = n;
      for (int j = 0; j < 19; j++) {
        if (a[i] & (1 << j)) {
          if (a[last[i][j]] & (1 << k))
            dp[i][k] = min(dp[i][k], last[i][j]);
          else
            dp[i][k] = min(dp[i][k], dp[last[i][j]][k]);
        }
      }
      if (dp[i][k] == n) dp[i][k] = last[i][k];
    }
  }
}
int main() {
  int q, x, y;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  a[n] = 0;
  preprocess();
  for (int i = 0; i < q; i++) {
    cin >> x >> y;
    x--;
    y--;
    bool alcanca = false;
    for (int j = 0; j < 19; j++) {
      alcanca |= (a[y] & (1 << j)) && dp[x][j] <= y;
    }
    cout << (alcanca ? "Shi" : "Fou") << endl;
  }
}
