#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long INFL = 9223372036854775807LL;
const double EPSILON = 0.00000001;
const long long MOD = 1000000007;
int one_step[19 + 1];
int min_exchange[2][19 + 1][19 + 1];
int pos[300000 + 5][19 + 1];
int32_t main() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  int max_val = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    ;
  }
  fill_n(min_exchange[0][0],
         sizeof(min_exchange) / sizeof(min_exchange[0][0][0]), INF);
  for (int i = n - 1; i >= 0; i--) {
    for (int b = 0; b <= 19; b++) {
      for (int c = 0; c <= 19; c++) {
        if ((a[i] & (1 << b)) && (a[i] & (1 << c))) {
          min_exchange[i & 1][b][c] = i;
        } else
          min_exchange[i & 1][b][c] = min_exchange[(i + 1) & 1][b][c];
      }
    }
    for (int b = 0; b <= 19; b++) {
      one_step[b] = (a[i] & (1 << b)) ? i : INF;
    }
    for (int b = 0; b <= 19; b++) {
      if (a[i] & (1 << b)) {
        for (int c = 0; c <= 19; c++) {
          if (not(a[i] & (1 << c))) {
            one_step[c] = ((one_step[c]) < (min_exchange[i & 1][b][c])
                               ? (one_step[c])
                               : (min_exchange[i & 1][b][c]));
          }
        }
      }
    };
    for (int b = 0; b <= 19; b++) {
      if (a[i] & (1 << b))
        pos[i][b] = i;
      else {
        pos[i][b] = INF;
        for (int c = 0; c <= 19; c++) {
          if (one_step[c] != INF)
            pos[i][b] =
                ((pos[i][b]) < (pos[one_step[c]][b]) ? (pos[i][b])
                                                     : (pos[one_step[c]][b]));
        }
      }
    };
  }
  for (int _ = 0; _ < q; _++) {
    int x, y;
    scanf("%d", &x);
    ;
    scanf("%d", &y);
    ;
    x--;
    y--;
    bool found = false;
    for (int b = 0; b <= 19; b++) {
      if ((a[y] & (1 << b)) and pos[x][b] <= y) {
        found = true;
        break;
      }
    }
    if (found)
      printf("Shi\n");
    else
      printf("Fou\n");
  }
  return 0;
}
