#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 228;
const long long infll = 1e18;
const long long mod = 1e9 + 7;
const long double eps = 1e-5;
const long long mod2 = 998244353;
const long double PI = atan2l(0, -1);
void fast_io() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const long long maxn = 3e5 + 228;
long long dp[maxn][20];
void solve() {
  long long n, q;
  cin >> n >> q;
  vector<long long> a(n);
  for (long long &i : a) cin >> i;
  vector<long long> lst(20, 0);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j < 20; j++) {
      if ((1 << j) & a[i - 1]) {
        dp[i][j] = lst[j];
        for (long long l = 0; l < 20; l++) {
          dp[i][l] = max(dp[i][l], dp[lst[j]][l]);
        }
        lst[j] = i;
      }
    }
  }
  for (long long i = 0; i < q; i++) {
    long long l, r;
    cin >> l >> r;
    bool ans = false;
    for (long long j = 0; j < 20; j++) {
      if ((1 << j) & a[l - 1]) {
        if (dp[r][j] >= l) ans = true;
      }
    }
    cout << (ans ? "Shi" : "Fou") << '\n';
  }
}
signed main() {
  fast_io();
  srand(time(NULL));
  long long q = 1;
  while (q--) solve();
}
