#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
inline long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
inline long long power(long long a, long long n, long long m) {
  if (n == 0) return 1;
  long long p = power(a, n / 2, m);
  p = (p * p) % m;
  if (n % 2)
    return (p * a) % m;
  else
    return p;
}
const long long MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
long long dp1[300001][31];
long long dp2[300001][31];
long long sm[31];
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  long long q;
  cin >> q;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0; i <= 30; i++) {
    dp1[n][i] = INF;
    dp2[n][i] = INF;
    sm[i] = INF;
  }
  for (long long i = n - 1; i >= 0; i--) {
    for (long long j = 0; j < 31; j++) {
      dp1[i][j] = sm[j];
      if ((a[i] & (1 << j))) sm[j] = i;
    }
  }
  long long k, cnt = 0;
  for (long long i = n - 1; i >= 0; i--) {
    for (long long j = 0; j < 31; j++) {
      dp2[i][j] = INF;
      if (a[i] & (1 << j)) dp2[i][j] = i;
      k = 1;
      cnt = 0;
      while (k <= a[i]) {
        if ((k & a[i]) && (dp1[i][cnt] <= n))
          dp2[i][j] = min(dp2[i][j], dp2[dp1[i][cnt]][j]);
        k = k << 1;
        cnt++;
      }
    }
  }
  long long x, y, ans;
  while (q--) {
    cin >> x >> y;
    x--;
    y--;
    k = 1;
    cnt = 0;
    ans = 0;
    while (k <= a[y]) {
      if (k & a[y]) {
        if (dp2[x][cnt] <= y) ans = 1;
      }
      k = k << 1;
      cnt++;
    }
    if (ans)
      cout << "Shi"
           << "\n";
    else
      cout << "Fou"
           << "\n";
  }
  return 0;
}
