// code of JUYU ^ ^ never doubt youself !
#include <bits/stdc++.h>
typedef long long ll;
#define int ll
#define For(i,a,b) for (int i = a; i <= b; i ++)
#define Dow(i,a,b) for (int i = b; i >= a; -- i)
#define ms(a,b) memset(a, b, sizeof (a))
#define fir first
#define sec second
#define mk make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef pair<int,int> PII;
const int mod = 998244353;
const int MOD = 1000000007;
const int maxn = 2e5 + 5;
inline ll read()
{
ll t = 0, dp = 1; char c = getchar();
while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();}
while(isdigit(c)) t = t * 10 + c - 48, c = getchar();
return t * dp;
}
inline void write(ll x){if (x < 0){putchar('-'); x = -x;} if(x >= 10) write(x / 10); putchar(x % 10 + 48);}
inline void writeln(ll x){write(x); puts("");}
inline void write_p(ll x){write(x); putchar(' ');}
inline void write_b(ll x){putchar(' '); write(x);}
inline int qpow(int x, int y, int z){int ret = 1; for (; y; y /= 2, x = x * x % z) if (y & 1) ret = ret * x % z; return ret;}
inline int PrimeInv(int x, int y, int z){return qpow(x, y - 2, z);}
int n, q;
string S;
int mn[maxn * 4], tag[maxn * 4];
int sum[maxn];
inline void update(int x)
{
mn[x] = min(mn[x * 2], mn[x * 2 + 1]);
}
inline void pushdown(int x)
{
mn[x * 2] += tag[x]; tag[x * 2] += tag[x];
mn[x * 2 + 1] += tag[x]; tag[x * 2 + 1] += tag[x];
tag[x] = 0;
}
inline void build(int x, int l, int r)
{
if (l == r)
{
mn[x] = sum[l];
return ;
}
int mid = (l + r) / 2;
build(x * 2, l, mid);
build(x * 2 + 1, mid + 1, r);
update(x);
}
inline void change(int x, int l, int r, int ql, int qr, int v)
{
if (ql <= l && qr >= r)
{
mn[x] += v; tag[x] += v;
return ;
}
pushdown(x);
int mid = (l + r) / 2;
if (ql <= mid) change(x * 2, l, mid, ql, qr, v);
if (qr > mid) change(x * 2 + 1, mid + 1, r, ql, qr, v);
update(x);
}
inline int query(int x, int l, int r, int ql, int qr)
{
if (ql <= l && qr >= r) return mn[x];
int mid = (l + r) / 2, ans = MOD;
pushdown(x);
if (ql <= mid) ans = min(ans, query(x * 2, l, mid, ql, qr));
if (qr > mid) ans = min(ans, query(x * 2 + 1, mid + 1, r, ql, qr));
return ans;
}
inline void sub(int x)
{
int v = S[x] == '(' ? -1 : 1;
change(1, 1, n, x, n, v);
}
inline void add(int x)
{
int v = S[x] == '(' ? 1 : -1;
change(1, 1, n, x, n, v);
}
signed main()
{
n = read(), q = read();
cin >> S; S = "0" + S;
For(i,1,n) sum[i] = sum[i - 1] + (S[i] == '(' ? 1 : -1);
build(1, 1, n);
while (q --)
{
int op = read(), l = read(), r = read();
if (op == 1)
{
sub(l); sub(r);
swap(S[l], S[r]);
add(l); add(r);
}
else
{
int ql = l == 1 ? 0 : query(1, 1, n, l - 1, l - 1);
int qr = query(1, 1, n, r, r);
if (ql != qr)
{
puts("No"); continue;
}
int qmid = query(1, 1, n, l, r);
if (qmid < ql)
{
puts("No"); continue;
}
puts("Yes");
}
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
-- Benq
*/