#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 50;
const int LOGN = 20;
int a[MAXN], n, q;
vector<int> adj[MAXN];
int dp[MAXN][LOGN];
void findDP() {
  for (int x = 0; x < LOGN; x++) {
    int prev = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i] & (1 << x)) {
        adj[prev].push_back(i);
        prev = i;
      }
    }
  }
  for (int i = 0; i < MAXN; i++)
    for (int j = 0; j < LOGN; j++) dp[i][j] = 87654321;
  for (int x = 0; x < LOGN; x++)
    if (a[n] & (1 << x)) dp[n][x] = n;
  for (int m = n - 1; m >= 1; m--) {
    for (int x = 0; x < LOGN; x++) {
      if (a[m] & (1 << x)) {
        dp[m][x] = m;
        continue;
      }
      for (auto e : adj[m]) dp[m][x] = min(dp[m][x], dp[e][x]);
    }
  }
}
void solve(int s, int t) {
  for (int x = 0; x < LOGN; x++) {
    if ((a[t] & (1 << x)) && dp[s][x] <= t) {
      printf("Shi\n");
      return;
    }
  }
  printf("Fou\n");
}
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  findDP();
  while (q--) {
    int s, t;
    scanf("%d%d", &s, &t);
    solve(s, t);
  }
}
