Multiplication in Base N (tiny)

This problem differs from N-base Multiplication (HUGE) only in the length limits on $A$ and $B$.

Write a program that multiplies two integers $A$ and $B$ written in base $N$.

The digits of $A$ and $B$ map to ASCII characters in order. $0$ is ! (ASCII 33), $1$ is " (ASCII 34), and so on, so $i$ is the character with code $33+i$. A negative sign is written as ~ (ASCII code $126$). It appears only at the front, at most once, and only when $N$ is positive.

ASCII character mapping table for each digit

The examples below show numbers written as described above. To make them easier to read, each digit is wrapped in square brackets.

$\[1]\[2]\[5]\_{(10)}=$"#&

$-\[1]\[2]\[16]\_{(27)}=$~"#1

$\[9]\[0]\[12]\_{(-15)}=$*!-

$\[43]\[52]\[44]\[40]\_{(69)}=$LUMI

$N$ may be a negative integer. See the hint for how negative bases work.

The first line contains the base $N(2 \le |N| \le 93)$.

The second and third lines contain $A$ and $B$, each written in base $N$. Each of $A$ and $B$ has at most $3\,000$ characters when written in base $N$.

Neither $A$ nor $B$ has an unnecessary leading !. ~ appears only when $N$ is positive, and at most once at the front. Note that $N$ can be negative.

Print the product of $A$ and $B$ in base $N$.

In a negative base $N$, a carry into the next position on the left multiplies the value by $N$, just as in a positive base. The only difference is that the digit in each position is limited to $0 \le x \lt -N$.

For example, $9\,903$ in base $10$ is $11\,903$ in base $-10$.

$11\,903\_{(-10)} = 1 \times (-10) ^ 4 + 1 \times (-10) ^ 3 + 9 \times (-10) ^ 2 + 0 \times (-10) ^ 1 + 3 \times (-10) ^ 0 = 9\,903 \_{(10)}$.