#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef long double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } int query(int x, int y) { cout << x + 1 << " " << y + 1 << endl; string res; cin >> res; if (res[0] == 'B')return 1; else if (res[0] == 'W')return 0; else exit(0); return -1; } int dx[4] = { 1,0,-1,0 }; int dy[4] = { 0,1,0,-1 }; bool used[500][500][4]; void solve() { int n, m; cin >> n >> m; vector> col(n, vector(n, -1)); col[0][0] = col[n - 1][n - 1] = 1; int cx = 0, cy = 0, d = 0; while (true) { if (used[cx][cy][d])break; used[cx][cy][d] = true; int nx = cx + dx[d]; int ny = cy + dy[d]; bool valid = true; if (nx < 0 || ny < 0 || nx >= n || ny >= n) { valid = false; } else { if (col[nx][ny] < 0) { col[nx][ny] = query(nx, ny); } if (col[nx][ny] == 0)valid = false; } if (!valid) { d++; if (d == 4)d = 0; } else { cx = nx; cy = ny; d--; if (d < 0)d += 4; } } rep(d, 4)if (used[n - 1][n - 1][d]) { cout << "Yes" << endl; return; } cout << "No" << endl; } signed main() { //ios::sync_with_stdio(false); //cin.tie(0); //cout << fixed << setprecision(12); //init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }