#include <bits/stdc++.h>
using namespace std;
const int BIT = 19;
int n, a[300300], f[300300][BIT];
string check(int x, int y) {
  for (int i = 0; i < BIT; i++)
    if ((a[y] >> i & 1) && f[x][i] <= y) return "Shi";
  return "Fou";
}
void compute(int curF[]) {
  int flag[BIT] = {0};
  while (1) {
    int x = -1, minF = n;
    for (int i = 0; i < BIT; i++)
      if (!flag[i] && curF[i] < minF) {
        x = i;
        minF = curF[i];
      }
    if (x < 0) return;
    flag[x] = 1;
    for (int j = 0; j < BIT; j++) curF[j] = min(curF[j], f[minF][j]);
  }
}
int main() {
  ios::sync_with_stdio(0);
  int q, x, y;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  int last[BIT][BIT];
  for (int i = 0; i < BIT; i++)
    for (int j = 0; j < BIT; j++) last[i][j] = n;
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j < BIT; j++) f[i][j] = n;
    for (int j = 0; j < BIT; j++)
      if (a[i] >> j & 1) {
        f[i][j] = i;
        for (int k = 0; k < BIT; k++)
          if (a[i] >> k & 1)
            last[j][k] = i;
          else
            f[i][k] = min(f[i][k], last[j][k]);
      }
    compute(f[i]);
  }
  while (q--) {
    cin >> x >> y;
    cout << check(--x, --y) << '\n';
  }
}
