Huh, Easy

Chef wants to construct two special strings $S$ and $T$ of length $N$ using only characters $A$, $B$, and $C$ for a coding challenge. Both strings must satisfy: - No two adjacent characters are the same. - Their Longest Common Subsequence is exactly $K$. Chef needs your help to determine if it's possible to construct such strings $S$ and $T$. If it's possible, output the strings; otherwise, outpu