write a go solution for Description:
Alina has discovered a weird language, which contains only 4 words: textttA, textttB, textttAB, textttBA. It also turned out that there are no spaces in this language: a sentence is written by just concatenating its words into a single string.

Alina has found one such sentence s and she is curious: is it possible that it consists of precisely a words textttA, b words textttB, c words textttAB, and d words textttBA?

In other words, determine, if it's possible to concatenate these a+b+c+d words in some order so that the resulting string is s. Each of the a+b+c+d words must be used exactly once in the concatenation, but you can choose the order in which they are concatenated.

Input Format:
The first line of the input contains a single integer t (1<=t<=10^5) — the number of test cases. The description of the test cases follows.

The first line of each test case contains four integers a, b, c, d (0<=a,b,c,d<=2*10^5) — the number of times that words textttA, textttB, textttAB, textttBA respectively must be used in the sentence.

The second line contains the string s (s consists only of the characters textttA and textttB, 1<=|s|<=2*10^5, |s|=a+b+2c+2d)  — the sentence. Notice that the condition |s|=a+b+2c+2d (here |s| denotes the length of the string s) is equivalent to the fact that s is as long as the concatenation of the a+b+c+d words.

The sum of the lengths of s over all test cases doesn't exceed 2*10^5.

Output Format:
For each test case output textttYES if it is possible that the sentence s consists of precisely a words textttA, b words textttB, c words textttAB, and d words textttBA, and textttNO otherwise. You can output each letter in any case.

Note:
In the first test case, the sentence s is textttB. Clearly, it can't consist of a single word textttA, so the answer is textttNO.

In the second test case, the sentence s is textttAB, and it's possible that it consists of a single word textttAB, so the answer is textttYES.

In the third test case, the sentence s is textttABAB, and it's possible that it consists of one word textttA, one word textttB, and one word textttBA, as textttA+textttBA+textttB=textttABAB.

In the fourth test case, the sentence s is textttABAAB, and it's possible that it consists of one word textttA, one word textttAB, and one word textttBA, as textttA+textttBA+textttAB=textttABAAB.

In the fifth test case, the sentence s is textttBAABBABBAA, and it's possible that it consists of one word textttA, one word textttB, two words textttAB, and two words textttBA, as textttBA+textttAB+textttB+textttAB+textttBA+textttA=textttBAABBABBAA.. Output only the code with no comments, explanation, or additional text.