#include<bits/stdc++.h>
#define N 100050
#define M 13005
#define lowbit(x) (x & -x)
using namespace std;
int t[N], n;
void update(int x, int y) {
    for(; x <= n; x += lowbit(x)) t[x] += y;
}
int query(int x) {
    int ret = 0;
    for(; x; x -= lowbit(x)) ret += t[x];
    return ret;
}
int m, mod, a[N], f[M][20];
bitset<M> S;
int main() {
    scanf("%d%d%d", &n, &m, &mod);
    for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
    for(int i = 0; i < mod; i ++) f[i][0] = 1ll * i * i * i % mod;
    for(int j = 1; j <= 18; j ++)
        for(int i = 1; i < mod; i ++)
            f[i][j] = f[f[i][j - 1]][j - 1];
    
    while(m --) {
        int o, l, r;
        scanf("%d%d%d", &o, &l, &r);
        if(o == 2) update(l, 1), update(r + 1, -1);
        else {
            if(r - l + 1 > 13) printf("Yuno\n");
            else {
                int ff = 0; S.reset(); S[0] = 1;
                for(int i = l; i <= r; i ++) {
                    int x = a[i], tg = query(i);
                    for(int j = 18; j >= 0; j --) if((tg >> j) & 1) x = f[x][j];
                    x ++;
                    if((S & (S << x)).any()) {ff = 1; break;}
                    S |= (S << x);
                }
                if(ff) printf("Yuno\n");
                else printf("Yuki\n");
            }
        }
    }
    return 0;
}