#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 300010, LOG = 20;
int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN];
int BIT[LOG];
int dp[MAXN][LOG];
int solve(int x, int y) {
  for (int i = 0; i < LOG; i++)
    if (A[y] & (1 << i) && dp[x][i] <= y) return cout << "Shi" << '\n', 0;
  return cout << "Fou" << '\n', 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> A[i];
  A[n + 1] = -1;
  for (int i = 1; i <= n + 1; i++)
    for (int j = 0; j < LOG; j++) dp[i][j] = n + 1;
  for (int j = 0; j < LOG; j++) BIT[j] = n + 1;
  for (int i = n; i; i--) {
    for (int j = 0; j < LOG; j++)
      for (int k = 0; k < LOG; k++)
        if (A[i] & (1 << k)) dp[i][j] = min(dp[i][j], dp[BIT[k]][j]);
    for (int j = 0; j < LOG; j++)
      if (A[i] & (1 << j)) {
        BIT[j] = i;
        dp[i][j] = i;
      }
  }
  while (m--) {
    cin >> x >> y;
    solve(x, y);
  }
  return 0;
}
