#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
using namespace std;
const int N = 3e5 + 5;
int a[N], n, q, x, y;
int nxt[N][19], can[N][19];
int main() {
  scanf("%d %d", &n, &q);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < 19; ++i) nxt[n + 1][i] = -1;
  for (int i = n + 1; i >= 2; --i) {
    for (int j = 0; j < 19; ++j) {
      if (a[i] & (1 << j)) {
        nxt[i - 1][j] = i;
      } else
        nxt[i - 1][j] = nxt[i][j];
    }
  }
  for (int i = n; i >= 1; --i) {
    for (int j = 0; j < 19; ++j) {
      if (a[i] & (1 << j)) {
        can[i][j] = i;
      } else {
        can[i][j] = -1;
        for (int k = 0; k < 19; ++k) {
          if (!(a[i] & (1 << k))) continue;
          if (~nxt[i][k] && ~can[nxt[i][k]][j]) {
            if (~can[i][j])
              can[i][j] = min(can[nxt[i][k]][j], can[i][j]);
            else
              can[i][j] = can[nxt[i][k]][j];
          }
        }
      }
    }
  }
  while (q--) {
    scanf("%d %d", &x, &y);
    bool f = true;
    for (int i = 0; i < 19; ++i) {
      if (~can[x][i] && can[x][i] <= y && (a[y] & (1 << i))) {
        f = false;
        printf("Shi\n");
        break;
      }
    }
    if (f) printf("Fou\n");
  }
  return 0;
}
