#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int n, q;
int a[300001];
int d[300001][19], t[19];
int main() {
  scanf("%d%d", &n, &q);
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) scanf("%d", a + i);
  for (int(i) = (0); (i) <= (18); (i) += (1)) d[n][i] = t[i] = n;
  for (int(i) = (n - 1); (i) >= (0); (i) -= (1)) {
    for (int(j) = (0); (j) <= (18); (j) += (1)) d[i][j] = n;
    for (int(j) = (0); (j) <= (18); (j) += (1)) {
      if ((a[i] >> j) & 1) {
        for (int(k) = (0); (k) <= (18); (k) += (1))
          d[i][k] = min(d[i][k], d[t[j]][k]);
        t[j] = i;
        d[i][j] = i;
      }
    }
  }
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--, y--;
    bool ok = 0;
    for (int(j) = (0); (j) <= (18); (j) += (1))
      if ((a[y] >> j) & 1 && d[x][j] <= y) ok = 1;
    puts(ok ? "Shi" : "Fou");
  }
}
