#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<bitset>
using namespace std;
bitset<110000> bs1,bs2;
int a[110000];
int belong[110000];
struct node
{int opt,l,r,x,d,id;
}q[1100000];int n,m;
bool cmp1(node n1,node n2)
{if(belong[n1.l]<belong[n2.l]) return true;if(belong[n1.l]>belong[n2.l]) return false;if(belong[n1.l]==belong[n2.l]){if(n1.r<n2.r) return true;if(n1.r>n2.r) return false;}return false;
}
bool cmp2(node n1,node n2)
{return n1.id<n2.id;
}
int sum[110000];
void add(int x)
{sum[x]++;if(sum[x]==1) bs1[x]=1,bs2[n-x+1]=1;
}
void del(int x)
{sum[x]--;if(sum[x]==0) bs1[x]=0,bs2[n-x+1]=0;
}
int solve1(int x)
{if(((bs1)&(bs1>>x)).any()==true) return 1;else return 0;
}
int solve2(int x)
{if(((bs1)&(bs2>>(n-x+1))).any()==true) return 1;else return 0;
}
int solve3(int x)
{int t=int(sqrt(x+1));for(int i=1;i<=t;i++) if(x%i==0&&bs1[i]==1&&bs1[x/i]==1) return 1;return 0;
}
int main()
{scanf("%d%d",&n,&m);for(int i=1;i<=n;i++) scanf("%d",&a[i]);int block=int(sqrt(n));for(int i=1;i<=n;i++){int t=(i-1)/block+1;belong[i]=t;}for(int i=1;i<=m;i++){scanf("%d%d%d%d",&q[i].opt,&q[i].l,&q[i].r,&q[i].x);q[i].id=i;}sort(q+1,q+m+1,cmp1);int l=1,r=0;memset(sum,0,sizeof(sum));bs1.reset();bs2.reset();for(int i=1;i<=m;i++){while(l>q[i].l){l--;add(a[l]);}while(l<q[i].l){del(a[l]);l++;}while(r>q[i].r){del(a[r]);r--;}while(r<q[i].r){r++;add(a[r]);}if(q[i].opt==1) q[i].d=solve1(q[i].x);if(q[i].opt==2) q[i].d=solve2(q[i].x);if(q[i].opt==3) q[i].d=solve3(q[i].x);}sort(q+1,q+m+1,cmp2);for(int i=1;i<=m;i++) if(q[i].d==1) printf("yuno\n"); else printf("yumi\n");return 0;
}