#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()
{
    ll i,a,b,c,n,m,k;
    ios_base::sync_with_stdio(false);
    string input;
    cin.tie(0); cout.tie(0);
    cin >> i;
    while (i--)
    {
    	cin >> n >> m >> k;
        cin >> input;
        bool cond = false;
        ll temp = 0;
        ll cycle = 0;
        ll vv = 0;
        ll final;
        for (char c : input)
        {
            if (c == 'L')
            {
                temp--;
                m--;
            }
            else
            {
                temp++;
                m++;
            }
            vv++;
            if (m == 0 && cond == false)
            {
            	cond = true;
            	final = vv;
            }
            if (temp == 0 && cycle == 0)
            {
                cycle = vv;
            }
        }
        if (cond)
        {
            if (cycle != 0 && k >= final)
            {
                cout << 1 + ((k-final)/cycle) << '\n';
            }
            else
            {
                if (cycle == 0 && k >= final)
                {
                	cout << 1 << '\n';
                }
                else
                {
                    cout << 0 << '\n';
                }
            }
        }
        else
        {
            cout << 0 << '\n';
        }
    }
}