CCC '26 J3 - Creative Candy Consumption

Problem Description
Ngoc and Minh devised a creative way to eat candy that comes in three different colours: red, green, and blue. They begin by arranging some coloured candies into a line. Then, the candy at the front of Ngoc's line is compared to the candy at the front of Minh's line.

• If both candies are the same colour, then Ngoc and Minh each eat the candy at the front of their own line.
• If the candies are different colours, then the person with the winning candy eats the losing candy, and the winning candy stays at the front of its line.

The winning rules are as follows:

• Red candy R wins against green candy G.
• Green candy G wins against blue candy B.
• Blue candy B wins against red candy R.

This process of comparing and eating candy repeats until there is at least one empty line of candy. When that happens, if one person still has candy left in their line, then that person eats all of their leftover candy. Your job is to determine how much candy each person eats.

Input Specification
The first line of input contains a sequence of $N$ letters, representing Ngoc's line of candy. The second line contains a sequence of $M$ letters, representing Minh's line of candy. Each letter will be an uppercase R, G, or B representing the colours red, green, and blue, respectively. The first letter in each sequence represents the colour of the candy at the front of that person's line. There will always be at least one letter in each sequence.

Output Specification
There will be two lines of output.

• On the first line, output the number of candies Ngoc eats.
• On the second line, output the number of candies Minh eats.

Sample Input

Sample Output

Explanation for Sample Output

1. Ngoc: RRR, Minh: RGBB. Both have red candy at the front. Both eat their red candy. (Ngoc: 1, Minh: 1).
2. Ngoc: RR, Minh: GBB. Ngoc's red candy wins against Minh's green candy. Ngoc eats the green candy. (Ngoc: 2, Minh: 1).
3. Ngoc: RR, Minh: BB. Minh's blue candy wins against Ngoc's red candy. Minh eats Ngoc's red candy. (Ngoc: 2, Minh: 2).
4. Ngoc: R, Minh: BB. Minh's blue candy wins against Ngoc's red candy. Minh eats Ngoc's red candy. (Ngoc: 2, Minh: 3).
5. Ngoc's line is empty. Minh eats his remaining 2 blue candies. (Ngoc: 2, Minh: 5).