Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Clarke is a patient with multiple personality disorder. One day, Clarke turned into a junior student and took a chemistry exam.

But he did not get full score in this exam. He checked his test paper and found a naive mistake, he was wrong with a simple chemical equation balancer.

He was unhappy and wanted to make a program to solve problems like this.

This chemical equation balancer follow the rules:

Two valences $A$ combined by $|A|$ elements and $B$ combined by $|B|$ elements.

We get a new valence $C$ by a combination reaction and the stoichiometric coefficient of $C$ is $1$. Please calculate the stoichiometric coefficient $a$ of $A$ and $b$ of $B$ that $aA + bB = C,\ \ a, b \in \text{N}^*$.

But he did not get full score in this exam. He checked his test paper and found a naive mistake, he was wrong with a simple chemical equation balancer.

He was unhappy and wanted to make a program to solve problems like this.

This chemical equation balancer follow the rules:

Two valences $A$ combined by $|A|$ elements and $B$ combined by $|B|$ elements.

We get a new valence $C$ by a combination reaction and the stoichiometric coefficient of $C$ is $1$. Please calculate the stoichiometric coefficient $a$ of $A$ and $b$ of $B$ that $aA + bB = C,\ \ a, b \in \text{N}^*$.

The first line contains an integer $T(1 \le T \le 10)$, the number of test cases.

For each test case, the first line contains three integers $A, B, C(1 \le A, B, C \le 26)$, denotes $|A|, |B|, |C|$ respectively.

Then $A+B+C$ lines follow, each line looks like $X\ c$, denotes the number of element $X$ of $A, B, C$ respectively is $c$. ($X$ is one of $26$ capital letters, guarantee $X$ of one valence only appear one time, $1 \le c \le 100$)

For each test case, the first line contains three integers $A, B, C(1 \le A, B, C \le 26)$, denotes $|A|, |B|, |C|$ respectively.

Then $A+B+C$ lines follow, each line looks like $X\ c$, denotes the number of element $X$ of $A, B, C$ respectively is $c$. ($X$ is one of $26$ capital letters, guarantee $X$ of one valence only appear one time, $1 \le c \le 100$)

For each test case, if we can balance the equation, print $a$ and $b$. If there are multiple answers, print the smallest one, $a$ is smallest then $b$ is smallest. Otherwise print NO.

提交代码