Lexicographic Detective

You have an $N \times N$ character matrix $A$ composed of lowercase letters, but you have forgotten the matrix. Fortunately, you still remember $N^2$ strings $S_{ij}$ ($1 \leq i,j \leq N$) of length $N$, and an $N \times N$ integer matrix $B$ . For all $1 \le i,j \le N$: - If $B_{ij}=0$, $S_{ij}$ represents the string with the **smaller** lexicographical order between the string represented by