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.math.BigInteger;
	import java.util.ArrayList;
	import java.util.Arrays;
	import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
	import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;
import java.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.Scanner; 
import java.util.StringTokenizer;
import java.util.TreeMap; 
	public class SequenceWithDigits {
	
		static FastReader sc= new FastReader();
		static List<Integer> C;
		static List<Integer> B;
		
		
		
		public static void main(String[] args) {
		
			int t=sc.nextInt();
		
			while(t-->0) {
				
				long a=sc.nextLong();
				long b=sc.nextLong();
				long p=sc.nextLong();
				String A=sc.next();

			ArrayList<Long> li=new ArrayList<>(Collections.nCopies(A.length(),0l));
			
			
			
			for(int i=A.length()-2;i>=1;i--) {
				
				if(A.charAt(i)=='B') {
					li.set(i,li.get(i+1)+b);
					while(A.charAt(i)==A.charAt(i-1)) {
						li.set(i-1,li.get(i));
						i--;
						if(i==0)break;
					}
					
				}
				if(A.charAt(i)=='A') {
					li.set(i,li.get(i+1)+a);
					while(A.charAt(i)==A.charAt(i-1)) {
						li.set(i-1,li.get(i));
						i--;
						if(i==0)break;
					}
					
				}
				
				
				
			}
			
			
			
			if(A.length()==2) {
				if(A.charAt(0)=='A')li.set(0,a);
				else li.set(0,b); 
			}
			else {
				if(li.get(0)==0) {
					if(A.charAt(0)==A.charAt(1))li.set(0, li.get(1));
					else {
						if(A.charAt(0)=='A')li.set(0,li.get(1)+a);
						else li.set(0,li.get(1)+b);
					}
				}
				
			}
			
					//System.out.println(li);
					
			for(int i=0;i<A.length();i++) {
				
				if(p>=li.get(i)) {System.out.println(i+1);break;}
				
			}
			
			}
			
			
		}
		
		
		static boolean search(ArrayList<Integer> a,int m,int h) {
			PriorityQueue<Integer> p=new PriorityQueue<Integer>(new Comparator<Integer>() {
					@Override
					public int compare(Integer o1, Integer o2) {
						// TODO Auto-generated method stub
						return o2-o1;
					}
			});
			
			
			
			for(int i=0;i<m;i++) {
				p.add(a.get(i));
			}
			int c=0;
			//System.out.println(p);
			while(!p.isEmpty()) {
				//System.out.println(p);

				h-=p.poll();
				if(h<0)break;
				
				c++;
				
			//	System.out.println(h+" "+p+" "+c+" "+m);

				if(!p.isEmpty()) {
				p.poll();
				c++;}
				
				
			}
		//	System.out.println(c!=m);
			if(c!=m)return false;
			
			return true;
		}
		static int  key=0;
		
		
		
		
		
		
		
		
		 static boolean isPerfectSquare(double x)  
		    { 
		          
		        // Find floating point value of 
		        // square root of x. 
		        double sr = Math.sqrt(x); 
		      
		        // If square root is an integer 
		        return ((sr - Math.floor(sr)) == 0); 
		    } 
		
		
		
		
		
		
	static	int binarySearch(ArrayList<Long> arr, int l, int r, long x) 
	    { 
	        if (r >= l) { 
	            int mid =  (r + l) / 2; 
	  
	            // If the element is present at the 
	            // middle itself 
	            if (arr.get(mid) == x) 
	                return mid; 
	  
	            // If element is smaller than mid, then 
	            // it can only be present in left subarray 
	            if (arr.get(mid) > x) {key=mid;
	                return binarySearch(arr, l, mid - 1, x); 
	            }
	            // Else the element can only be present 
	            // in right subarray
	            key=mid+1;
	            return binarySearch(arr, mid + 1, r, x); 
	        } 
	  
	        // We reach here when element is not present 
	        // in array 
	        return key; 
	    } 
		
		
		
		
		
		
		
		
	    static boolean isPrime(long n) 
	    { 
	        // Corner cases 
	        if (n <= 1) 
	            return false; 
	        if (n <= 3) 
	            return true; 
	  
	        // This is checked so that we can skip 
	        // middle five numbers in below loop 
	        if (n % 2 == 0 || n % 3 == 0) 
	            return false; 
	  
	        for (int i = 5; i * i <= n; i = i + 6) 
	            if (n % i == 0 || n % (i + 2) == 0) 
	                return false; 
	  
	        return true; 
	    } 
	    
	    
	    
	    static class FastReader 
	    { 
	        BufferedReader br; 
	        StringTokenizer st; 
	  
	        public FastReader() 
	        { 
	            br = new BufferedReader(new
	                     InputStreamReader(System.in)); 
	        } 
	  
	        String next() 
	        { 
	            while (st == null || !st.hasMoreElements()) 
	            { 
	                try
	                { 
	                    st = new StringTokenizer(br.readLine()); 
	                } 
	                catch (IOException  e) 
	                { 
	                    e.printStackTrace(); 
	                } 
	            } 
	            return st.nextToken(); 
	        } 
	  
	        int nextInt() 
	        { 
	            return Integer.parseInt(next()); 
	        } 
	  
	        long nextLong() 
	        { 
	            return Long.parseLong(next()); 
	        } 
	  
	        double nextDouble() 
	        { 
	            return Double.parseDouble(next()); 
	        } 
	  
	        String nextLine() 
	        { 
	            String str = ""; 
	            try
	            { 
	                str = br.readLine(); 
	            } 
	            catch (IOException e) 
	            { 
	                e.printStackTrace(); 
	            } 
	            return str; 
	        } 
	    } 
		
		
			
	}
