Digit Operation

You are given arrays $A$ and $B$, each consisting of $N$ **strings**, and a positive integer $K$. For all $1\le i \le N$, both $A_i$ and $B_i$ consist of characters from $0$ to $9$ (both inclusive). You can perform the following types of operations on array $A$: - Type $1$: Choose two indices $i$ and $j$ $(i\neq j)$ and swap any character of $A_i$ with any character of $A_j$. The cost of this o