#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#include <set>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define fo(i,n) for (long long i = 0; i < n; i++)
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    while(t--)
    {
        ll n, x, k;
        cin >> n >> x >> k;
        string s;
        cin >> s;
        
        ll current = x;
        ll t = 0;
        bool reachedZero = false;
        for (int i = 0; i < n; i++)
        {
            t++;
            if (s[i]=='L') 
            {
                current--;
            } 
            else 
            {
                current++;
            }
            if (current == 0)
            {
                reachedZero = true;
                break;
            }
        }
        
        if(!reachedZero)
        {
            cout << 0 << "\n";
            continue;
        }
        
        ll count = 1;
        ll remaining = k - t;
        if (remaining < 0) 
        {
            cout << count << "\n";
            continue;
        }
        
        
        current = 0;
        ll cycle_time = 0;
        bool cycleReset = false;
        for (int i = 0; i < n; i++)
        {
            cycle_time++; 
            if (s[i]=='L')
            {
                current--;
            }
            else
            {
                current++;
            }
            if (current == 0)
            {
                cycleReset = true;
                break;
            }
        }
        if (!cycleReset)
        {
            cout << count << "\n";
        } 
        else 
        {
            cout << count + remaining / cycle_time << "\n";
        }
    }
    return 0;
}