Submission

//Problem: abc331f
#include<iostream>
#include<algorithm>
#include<string.h>
#include<random>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define i32 INT_MAX
#define i64 LONG_LONG_MAX
#define pii std::pair<int, int>
#define pll std::pair<long long, long long>
#define pb push_back
#define fore(i,u,v) for(int i=head[u],v;i;i=e[i].nxt)
typedef long long ll;
const int N = 1e6 + 10;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}return x*f;}
void print(ll x){if(x<0)putchar('-'),x=-x;if(x>9)print(x/10);putchar(x%10+48);}
char gc(){char c=getchar();while(c==' '||c=='\n')c=getchar();return c;}
void pc(char Char){std::putchar(Char);}

int n, q;
ll a[N], b[N];
ll Mod[5] = {1000000007, 1000000087, 1000000021, 1000000009, 1000000033}, X[5];

ll Pow(ll x, ll y, ll mod) {
    ll res = 1;
    for(; y > 0; y >>= 1, x = x * x % mod) if(y & 1) res = res * x % mod;
    return res;
}

struct segt {
    #define mid (l + r >> 1)
    ll mod, x;
    ll t[N << 2];
    ll merge(ll u, ll v, ll LenU) {
        return (v * Pow(x, LenU, mod) % mod + u) % mod;
    }
    void pushup(int u, int l, int r) {
        t[u] = merge(t[u << 1], t[u << 1 | 1], mid - l + 1);
    }
    void build(int u, int l, int r, ll* array) {
        if(l == r) {
            t[u] = array[l];
            return;
        }
        build(u << 1, l, mid, array);
        build(u << 1 | 1, mid + 1, r, array);
        pushup(u, l, r);
    }
    void update(int u, int l, int r, int L, ll v) {
        if(l == r) {
            t[u] = v;
            return;
        }
        if(L <= mid) update(u << 1, l, mid, L, v);
        if(mid < L) update(u << 1 | 1, mid + 1, r, L, v);
        pushup(u, l, r);
    }
    ll query(int u, int l, int r, int L, int R) {
        if(L <= l && r <= R) {
            return t[u];
        }
        if(R <= mid) return query(u << 1, l, mid, L, R);
        if(L > mid) return query(u << 1 | 1, mid + 1, r, L, R);
        return merge(query(u << 1, l, mid, L, R), query(u << 1 | 1, mid + 1, r, L, R), mid - L + 1);
    }
    #undef mid
} T[5][2];

int main() {
    std::cin >> n >> q;
    for(int i = 1; i <= n; i++) {
        a[i] = b[n - i + 1] = gc() - 'a';
    }
    std::mt19937_64 rng(time(0));
    for(int i = 0; i < 5; i++) X[i] = rng() % Mod[i];
    for(int i = 0; i < 5; i++) for(int j = 0; j < 2; j++) T[i][j].mod = Mod[i], T[i][j].x = X[i];
    for(int i = 0; i < 5; i++) for(int j = 0; j < 2; j++) T[i][j].build(1, 1, n, ((j == 1) ? b : a));
    while(q--) {
        int opt = read();
        if(opt == 1) {
            int x = read(), v = gc() - 'a';
            for(int i = 0; i < 5; i++) T[i][0].update(1, 1, n, x, v), T[i][1].update(1, 1, n, n - x + 1, v);
        } else {
            int l = read(), r = read();
            bool ans = 1;
            for(int i = 0; i < 5; i++) {
                ans &= (T[i][0].query(1, 1, n, l, r) == T[i][1].query(1, 1, n, n - r + 1, n - l + 1));
                if(!ans) {
                    puts("No");
                    break;
                }
            }
            if(ans) puts("Yes");
            // print(T[0][0].query(1, 1, n, l, r)); pc(' '); print(T[0][1].query(1, 1, n, n - r + 1, n - l + 1)); pc('\n');
        }
    }
    return 0;
}