Binary Conversion

You are given binary strings $S$ and $T$, each of length $N$, and an integer $K$. Find whether it is possible to convert string $S$ to $T$ by making **exactly** $K$ operations of the following type: - Choose **distinct** indices $i$ and $j \ (1\le i, j \le N)$; - Swap $S_i$ with $S_j$. ### Input - The first line of input will contain a single integer $T'$, denoting the number of test cases. -