Ghadeer is a hard-working girl. After finishing university, she decided to apply for a job. The manager gave her a problem to solve.
You are given two digital numbers of length $$$n$$$ and you have to make them equal by using the following operations.
The first operation can only be used at most $$$x$$$ times. The second operation can only be used at most $$$y$$$ times.
Example: To convert from $$$5$$$ to $$$4$$$, you have to use $$$2$$$ operations of the first type and 1 operation of the second type.
You are asked to determine if she can make the two numbers equal.
The operations can be applied to any of the two numbers. Note: After doing the operations, the resulting number should be a valid digital number
The first line contains an integer $$$T$$$ $$$(1 \leq T \leq 100)-$$$ the number of testcases.
Each test case has $$$3$$$ lines:
The first line contains $$$n$$$, $$$x$$$, $$$y$$$ $$$(1 \leq n,x,y \leq 100)-$$$ the number of digits of the two numbers, number of the first operation, number of second operation, respectively.
The second line contains $$$s$$$ $$$(1 \leq s \leq 10^{100})-$$$ the first number.
The third line contains $$$t$$$ $$$(1 \leq t \leq 10^{100})-$$$ the second number.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$100$$$.
For each test case , print "$$$YES$$$" if she can , otherwise print "$$$NO$$$".
43 2 32215475 10 1512345543212 1 223171 1 111
NO YES NO YES
