#include <iostream>
#include <queue>
#include <vector>
#include <string>

using namespace std;

struct State {
    int pos;
    int swim;
};

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;
        string river;
        cin >> river;

        vector<bool> visited(n + 2, false);
        queue<State> q;

        // Starting point at position 0
        q.push({0, 0});
        visited[0] = true;

        bool canReach = false;

        while (!canReach && !q.empty()) {
            State current = q.front();
            q.pop();

            int pos = current.pos;
            int swim = current.swim;

            // Try jumping from the current position
            if (pos == 0 || river[pos - 1] == 'L') {
                for (int jump = 1; jump <= m; ++jump) {
                    int newPos = pos + jump;
                    if (newPos == n + 1) {
                        canReach = true;
                        break;
                    }
                    if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {
                        visited[newPos] = true;
                        q.push({newPos, swim});
                    }
                }
            }

            // Try swimming to the next position if currently in water
            if (pos > 0 && pos <= n && river[pos - 1] == 'W' && swim < k) {
                int newPos = pos + 1;
                if (newPos == n + 1) {
                    canReach = true;
                    break;
                }
                if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {
                    visited[newPos] = true;
                    q.push({newPos, swim + 1});
                }
            }
        }

        cout << (canReach ? "YES" : "NO") << endl;
    }
    return 0;
}

#include <iostream>
using namespace std;
#include<bits/stdc++.h>
 
int main() 
{
    int numberOfTestCases;
    cin >> numberOfTestCases;
    while(numberOfTestCases--){
      
      int casseroleLength, initialPieces, finalPieces;
      cin >> casseroleLength >> initialPieces >> finalPieces;
      string monkActions;
      cin >> monkActions;
      int currentPieceIndex = initialPieces - 1, wastedPieces = 0, failedOperations = 0;
      for(auto actionIndex = 0; actionIndex < monkActions.size(); actionIndex++){
        char action = monkActions[actionIndex];
        if(action == 'L'){
          currentPieceIndex = initialPieces;
        }
        else if(action == 'W'){
          if(currentPieceIndex <= 0) wastedPieces++;
        }
        else{
          if(currentPieceIndex <= 0) failedOperations++;
        }
        currentPieceIndex--;
      }
      
      if(wastedPieces > finalPieces) failedOperations++;
      
      cout << (failedOperations!= 0? "NO" : "YES") << endl;
      
    }
    return 0;
}

DylanT bharath_kumar2005 Sumit2023102 Emil_Hajiyev xinglili ricaxov adxtya02 noname_000 ayush201 u_kidding_me govinthan_ks Immortal_22 thelonewolfclub torquise VarunGolcha shree_swami_samarth slayerr_1818

#include <bits/stdc++.h>
using namespace std;
 
void run() {
  int n; cin >> n;
 
  vector ans(0, pair(0, 0));
 
  string s;
  for (int a = 1; a <= 10000; a++) {
    s += to_string(n);
    for (int b = max(1, int(s.size())-6); b <= min(10000, a100) and b < int(s.size()); b++) {
      if (to_string(na-b) == s.substr(0, s.size()-b)) {
        ans.emplace_back(a, b);
      }
    }
  }
 
  cout << ans.size() << '\n';
  for (auto [a, b] : ans) {
    cout << a << ' ' << b << '\n';
  }
}
 
int main() {
  cin.tie(0)->sync_with_stdio(0);
 
  int t; cin >> t; while (t--) run();
} 

BugBlue hasan1485 KALiIi24 thegreat_gordini14 divyanshubissa88 muditlodha3 YuAn.HR whu_yx akshatchaudhary aakash_kalra ByteBard16 wzxaurora aloolelopls dinskid HyperNovaVY TLE_lord _tanush_ _rbr__iiita Dr.rabi3 Nitish_Bharat

Kartikey_21534 jainam_shah mmmm5 Pratham_2021347 Pulkit1501 sree_27 vikram_iitm phir_bhi_aas_lagi_hai sabbirsajids45 bawal Shivam_Yqdqv Phoenix750 ganesh_2004 madhuhasitha

Screenshot link