#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() { return abs((int)mt()); }
void solve() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  for (int i = (0); i < (n); ++i) cin >> a[i];
  vector<vector<int>> dp(n, vector<int>(20, n));
  vector<int> lst(20, n);
  for (int i = (n)-1; i >= (0); --i) {
    priority_queue<pair<int, int>> heap;
    for (int j = (0); j < (20); ++j)
      if ((((a[i]) >> (j)) & 1)) {
        dp[i][j] = lst[j];
        lst[j] = i;
        if (dp[i][j] < n) {
          heap.push(make_pair(-dp[i][j], j));
        }
      }
    while (int((heap).size())) {
      int t = -heap.top().first;
      int j = heap.top().second;
      heap.pop();
      for (int k = (0); k < (20); ++k)
        if (chkmin(dp[i][k], dp[t][k])) {
          heap.push(make_pair(-dp[i][k], k));
        }
    }
  }
  while (q--) {
    int l, r;
    cin >> l >> r;
    l--, r--;
    int res = 0;
    for (int i = (0); i < (20); ++i)
      if ((((a[r]) >> (i)) & 1) && dp[l][i] <= r) {
        res = 1;
        break;
      }
    if (res) {
      cout << "Shi\n";
    } else {
      cout << "Fou\n";
    }
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  solve();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
