HandsOn $>$s Strange String Formation

You have a sequence of strings $s1,s2,s3,$dots,$sn$ and an empty string $k.$

You repeat the following steps $n$ times to generate the value of hat$(k).$

At thes $i^2$ th step, you will concatenates string si with $k$ either from the left $($forming si $+k)$ or s ${?}^1$ from the right $($forming $k+si)$

For example, a sequence of strings $\text{'}ab\text{'},\text{'}$c$\text{'},$ 'def' could result in strings $\text{'}$ abcdef $\text{'},$ 'defcab', or 'defabc' depending on the sequence of concatenations chosen.

You are given $t$ independent string pairs a and $b.$ For each pair determine if there exists a sequence of strings that will allow you to generate both a and $b$ using the same process used to generate $k_{,If}$ it is possible the answer is "YES" and this is stored in an array $x.$ Otherwise, your answer is $"$NO$"$ and it is stored in arsay $x.$

Find the array $x.$

Input Format

The first line contains an integer, $t,$ denoting the number of independent string pairs.

Each line $i$ of the $t$ subsequent lines $($where iitb$[i]1t20$

$1$len$(a[i])1000i0i$

$1$

HandsOn $>$ Strange String Formation

You have a sequence of strings $s1,s2,s3,$dots,$sn$ and an empty string $k.$

You repeat the following steps $n$ times to generate the value of hat$(k).$

At the it$-$th step, you will concatenates string si with $k$ either from the left $($forming $si+k)$ ob from the right $($forming $k+si).$

For example, a sequence of strings $\text{'}ab\text{'},\text{'}c\text{'},$ 'def' could result in strings $\text{'}abc$ def', 'defcab', or 'defabc' depending on the sequence of concatenations chosen.

You are given $t$ independent string pairs a and $b.$ For each pair determine if there exists a sequence of strings that will allow you to generate both a and $b$ using the same process used to generate $k_{,If}$ it is possible the answer is "YES" and this is stored in an array $x.$ Otherwise, your answer is $"$NO$"$ and it is stored in array $x.$

Find the array $x.$

Input Format

The first line contains an integer, $t,$ denoting the number of independent string pairs.

Each line $i$ of the $t$ subsequent lines $($where itb$[i]1t20$

$1$len$(a[i])1000i0i$