#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b)	for (int i(a); i <= (b); ++i)

#define dec(i, a, b)	for (int i(a); i >= (b); --i)

typedef long long LL;

const int N = 1e5 + 10;

const int S = 1e5;

int n, m, l, r, BS;

int belong[N], b[N], cnt[N], ans[N];

bitset <N> f, g;

struct node{

	int op, l, r, x, id;

	friend bool operator < (const node &a, const node &b){

		return belong[a.l] == belong[b.l] ? belong[a.r] < belong[b.r] : belong[a.l] < belong[b.l];

	}

} q[N];

int main(){

	scanf("%d%d", &n, &m);

	BS = (int)sqrt(n + 0.5);

	rep(i, 1, n) scanf("%d", b + i);

	rep(i, 1, m){

		int x, y, z, w;

		scanf("%d%d%d%d", &x, &y, &z, &w);

		q[i] = (node){x, y, z, w, i};

	}

	rep(i, 1, n) belong[i] = (i - 1) / BS + 1;

	sort(q + 1, q + m + 1);

	l = 0, r = 0;

	rep(i, 1, m){

		while (l > q[i].l){

			--l;

			++cnt[b[l]];

			f[b[l]] = 1;

			g[S - b[l]] = 1;

		}

		while (r < q[i].r){

			++r;

			++cnt[b[r]];

			f[b[r]] = 1;

			g[S - b[r]] = 1;

		}

		while (l < q[i].l){

			--cnt[b[l]];

			if (!cnt[b[l]]){

				f[b[l]] = 0;

				g[S - b[l]] = 0;

			}

			++l;

		}

		while (r > q[i].r){

			--cnt[b[r]];

			if (!cnt[b[r]]){

				f[b[r]] = 0;

				g[S - b[r]] = 0;

			}

			--r;

		}

		if (q[i].op == 1) ans[q[i].id] = ((f >> q[i].x) & f).any();

		if (q[i].op == 2) ans[q[i].id] = ((g >> (S - q[i].x)) & f).any();

		if (q[i].op == 3){

			if (q[i].x == 0 && f[0]) ans[q[i].id] = 1;

			else

			for (int j = 1; j * j <= q[i].x; ++j) if (q[i].x % j == 0)

				if (f[j] && f[q[i].x / j]){

					ans[q[i].id] = 1;

					break;

				}

		}

	}

	rep(i, 1, m) puts(ans[i] ? "yuno" : "yumi");

	return 0;

}