#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int loga[300001 + 1];
int st[300001][19 + 1];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q;
  cin >> n >> q;
  loga[1] = 0;
  for (int i = 2; i <= 300001; i++) loga[i] = loga[i / 2] + 1;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (int i = 0; i < n; i++) st[i][0] = arr[i];
  for (int j = 1; j <= 19; j++)
    for (int i = 0; i + (1 << j) <= n; i++)
      st[i][j] = (st[i][j - 1] | st[i + (1 << (j - 1))][j - 1]);
  int x, y;
  vector<pair<int, int> > queries;
  vector<bool> ans;
  while (q--) {
    cin >> x >> y;
    x--;
    y--;
    queries.push_back({x, y});
  }
  int bmin, bmax, bmid, temp, currOr, currBegin, lookup, llog;
  for (int i = 0; i < queries.size(); i++) {
    x = queries[i].first;
    y = queries[i].second;
    currOr = arr[x];
    currBegin = x + 1;
    while (currBegin < y) {
      bmin = currBegin;
      bmax = y - 1;
      while (bmin < bmax) {
        bmid = (bmin + bmax) >> 1;
        llog = loga[bmid - currBegin + 1];
        temp = (st[currBegin][llog] | st[bmid - (1 << llog) + 1][llog]);
        if ((currOr & temp) == 0 || ((currOr | temp) == currOr)) {
          bmin = bmid + 1;
        } else {
          bmax = bmid;
        }
      }
      if (bmin < y && currOr & arr[bmin]) {
        currOr |= arr[bmin];
      }
      currBegin = bmin + 1;
    }
    if (currOr & arr[y]) {
      ans.push_back(true);
    } else {
      ans.push_back(false);
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i]) {
      cout << "Shi" << '\n';
    } else {
      cout << "Fou" << '\n';
    }
  }
}
