After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bus or the tram station at each crossroad.

The crossroads are represented as a string s of length n, where s_i = A, if there is a bus station at i-th crossroad, and s_i = B, if there is a tram station at i-th crossroad. Currently Petya is at the first crossroad (which corresponds to s_1) and his goal is to get to the last crossroad (which corresponds to s_n).

If for two crossroads i and j for all crossroads i, i+1, …, j-1 there is a bus station, one can pay a roubles for the bus ticket, and go from i-th crossroad to the j-th crossroad by the bus (it is not necessary to have a bus station at the j-th crossroad). Formally, paying a roubles Petya can go from i to j if s_t = A for all i ≤ t < j. 

If for two crossroads i and j for all crossroads i, i+1, …, j-1 there is a tram station, one can pay b roubles for the tram ticket, and go from i-th crossroad to the j-th crossroad by the tram (it is not necessary to have a tram station at the j-th crossroad). Formally, paying b roubles Petya can go from i to j if s_t = B for all i ≤ t < j.

For example, if s="AABBBAB", a=4 and b=3 then Petya needs:

<image>

  * buy one bus ticket to get from 1 to 3, 
  * buy one tram ticket to get from 3 to 6, 
  * buy one bus ticket to get from 6 to 7. 



Thus, in total he needs to spend 4+3+4=11 roubles. Please note that the type of the stop at the last crossroad (i.e. the character s_n) does not affect the final expense.

Now Petya is at the first crossroad, and he wants to get to the n-th crossroad. After the party he has left with p roubles. He's decided to go to some station on foot, and then go to home using only public transport.

Help him to choose the closest crossroad i to go on foot the first, so he has enough money to get from the i-th crossroad to the n-th, using only tram and bus tickets.

Input

Each test contains one or more test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^4).

The first line of each test case consists of three integers a, b, p (1 ≤ a, b, p ≤ 10^5) — the cost of bus ticket, the cost of tram ticket and the amount of money Petya has.

The second line of each test case consists of one string s, where s_i = A, if there is a bus station at i-th crossroad, and s_i = B, if there is a tram station at i-th crossroad (2 ≤ |s| ≤ 10^5).

It is guaranteed, that the sum of the length of strings s by all test cases in one test doesn't exceed 10^5.

Output

For each test case print one number — the minimal index i of a crossroad Petya should go on foot. The rest of the path (i.e. from i to n he should use public transport).

Example

Input


5
2 2 1
BB
1 1 1
AB
3 2 8
AABBBBAABB
5 3 4
BBBBB
2 1 1
ABABAB


Output


2
1
3
1
6

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Contest {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    public static void main(String[] args) {
        new Contest().run();
    }

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time(ms) = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }

    class MyComparator implements Comparable<MyComparator> {

        int x;
        int y;

        public MyComparator(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(MyComparator a) {
            if (x == a.x) {
                return (y - a.y);
            }
            return x - a.x;
        }
    }

    public static boolean isPrime(int num) {
        if (num > 2 && num % 2 == 0) {
            //System.out.println(num + " is not prime");
            return false;
        }
        int top = (int) Math.sqrt(num) + 1;
        for (int i = 3; i < top; i += 2) {
            if (num % i == 0) {
                //System.out.println(num + " is not prime");
                return false;
            }
        }
        //System.out.println(num + " is prime");
        return true;
    }

    private static long gcd(long a, long b) {
        BigInteger b1 = BigInteger.valueOf(a);
        BigInteger b2 = BigInteger.valueOf(b);
        BigInteger gcd = b1.gcd(b2);
        return gcd.longValue();
    }

    public void solveE() throws IOException {

    }

    public void solveD() throws IOException {

    }

    public void solveC2() throws IOException {

    }

    public void solveC() throws IOException {
        int t = readInt();
        outerloop:
        for (int k = 0; k < t; k++) {
            int n = readInt();
            int[] array = new int[n];
            for (int j = 0; j < n; j++) {
                array[j] = readInt();
            }
            TreeSet<Integer> set = new TreeSet<>();
            for (int i = 1; i <= 2 * n; i++) {
                set.add(i);
            }
            for (int j = 0; j < n; j++) {
                set.remove(array[j]);
            }

            StringBuilder builder = new StringBuilder();
            for (int j = 0; j < n; j++) {
                builder.append(array[j]).append(" ");
                Integer next = set.ceiling(array[j]);
                if (next == null) {
                    System.out.println("-1");
                    continue outerloop;
                }
                set.remove(next);
                builder.append(next).append(" ");
            }
            builder.setLength(builder.length() - 1);
            System.out.println(builder);
        }
    }

    public void solve() throws IOException {
        int t = readInt();
        outerloop:
        for (int i = 0; i < t; i++) {
            int a = readInt();
            int b = readInt();
            int p = readInt();
            String s = readString();
            String[] split = s.split("");
            int size = split.length;

            int x = 0;
            int y = 0;

            String current = split[size - 1];

            if (split[size - 2].equals(current)) {
                if (current.equals("A")) {
                    x++;
                } else {
                    y++;
                }
            }

            int curprice = x * a + y * b;
            if (curprice > p) {
                System.out.println(size);
                continue outerloop;
            }

            for (int j = size - 1; j > 0; j--) {
                //System.out.print("price " + curprice);
                //System.out.println();
                if (!split[j - 1].equals(current)) {
                    if (current.equals("A")) {
                        y++;
                        if (curprice + b > p) {
                            System.out.println(j+1);
                            continue outerloop;
                        } else {
                            curprice += b;
                        }
                    } else {
                        x++;
                        if (curprice + a > p) {
                            System.out.println(j + 1);
                            continue outerloop;
                        } else {
                            curprice += a;
                        }
                    }
                }
                current = split[j - 1];
            }

            System.out.println("1");
        }

    }

    public void solveA() throws IOException {
        int t = readInt();
        for (int i = 0; i < t; i++) {
            int a = readInt();
            int b = readInt();
            int x = readInt();
            int y = readInt();
            int first = (x) * b;
            //System.out.println("f" + first);
            int second = (a - x - 1) * b;
            //System.out.println("f" + second);
            int third = a * (y);
            //System.out.println("f" + third);
            int forth = (a) * (b - y - 1);
            //System.out.println("f" + forth);
            int max1 = Math.max(first, second);
            int max2 = Math.max(third, forth);
            System.out.println(Math.max(max1, max2));
        }
    }

}
