1 #include <bits/stdc++.h>
 2
 3 using namespace std;
 4
 5 #define re register
 6 #define rep(i, a, b) for (re int i = a; i <= b; ++i)
 7 #define repd(i, a, b) for (re int i = a; i >= b; --i)
 8 #define maxx(a, b) a = max(a, b);
 9 #define minn(a, b) a = min(a, b);
10 #define LL long long
11 #define INF (1 << 30)
12
13 inline int read() {
14     int w = 0, f = 1; char c = getchar();
15     while (!isdigit(c)) f = c == '-' ? -1 : f, c = getchar();
16     while (isdigit(c)) w = (w << 3) + (w << 1) + (c ^ '0'), c = getchar();
17     return w * f;
18 }
19
20 const int maxn = 1e5 + 5;
21
22 bitset<maxn> S1, S2;
23
24 struct Query {
25     int l, r, id, pos, opt, x;
26 } q[maxn];
27 bool cmp(Query a, Query b) { return a.pos < b.pos || a.pos == b.pos && a.r < b.r; }
28
29 int n, m, a[maxn], ans, b[maxn], size, cnt[maxn];
30
31 void del(int x) { cnt[x]--; if (!cnt[x]) S1[x] = S2[n-x] = 0; }
32 void ins(int x) { if (!cnt[x]) S1[x] = S2[n-x] = 1; cnt[x]++; }
33
34 int main() {
35     n = read(), m = read();
36     size = sqrt(n);
37     rep(i, 1, n) a[i] = read();
38     rep(i, 1, m) q[i].opt = read(), q[i].l = read(), q[i].r = read(), q[i].x = read(), q[i].id = i, q[i].pos = (q[i].l + size - 1) / size;
39     sort(q+1, q+m+1, cmp);
40     int pl = 1, pr = 0;
41     rep(i, 1, m) {
42         while (pl < q[i].l) del(a[pl]), pl++;
43         while (pl > q[i].l) pl--, ins(a[pl]);
44         while (pr < q[i].r) pr++, ins(a[pr]);
45         while (pr > q[i].r) del(a[pr]), pr--;
46         if (q[i].opt == 1) {
47             b[q[i].id] = ((S1 << q[i].x) & S1).any() ? 1 : 0;
48         }
49         else if (q[i].opt == 2) {
50             b[q[i].id] = ((S2 >> (n-q[i].x)) & S1).any() ? 1 : 0;
51         }
52         else if (q[i].opt == 3) {
53             b[q[i].id] = 0;
54             rep(x, 1, sqrt(q[i].x))
55                 if (!(q[i].x % x) && S1[x] && S1[q[i].x/x]) { b[q[i].id] = 1; break; }
56         }
57     }
58     rep(i, 1, m) printf("%s\n", b[i] ? "hana" : "bi");
59     return 0;
60 }