#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
inline void amax(T &x, U y) {
  if (x < y) x = y;
}
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  long long n, q;
  cin >> n >> q;
  long long go[n + 1][30], last[n + 1][30];
  memset(last, -1, sizeof(last));
  memset(go, -1, sizeof(go));
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = n - 1 - 1; i >= 0; i--) {
    for (int j = 0; j < 30; j++) last[i + 1][j] = last[i + 2][j];
    for (int j = 0; j < 30; j++) {
      if ((a[i + 1] & (1 << j)) != 0) last[i + 1][j] = i + 2;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j < 30; j++) {
      if ((a[i] & (1 << j)) != 0) go[i + 1][j] = i + 1;
    }
    for (int k = 0; k < 30; k++) {
      for (int j = 0; j < 30; j++) {
        if ((a[i] & (1 << j)) != 0 && last[i + 1][j] != -1) {
          if (go[last[i + 1][j]][k] == -1) continue;
          if (go[i + 1][k] != -1)
            go[i + 1][k] = min(go[i + 1][k], go[last[i + 1][j]][k]);
          else
            go[i + 1][k] = go[last[i + 1][j]][k];
        }
      }
    }
  }
  while (q--) {
    long long x, y;
    cin >> x >> y;
    long long pos = 0;
    for (int i = 0; i < 30; i++) {
      if (go[x][i] <= y && ((a[y - 1] & (1 << i)) != 0) && go[x][i] != -1) {
        pos = 1;
        break;
      }
    }
    if (pos == 1)
      cout << "Shi\n";
    else
      cout << "Fou\n";
  }
  return 0;
}
