Submit solution

Points:
20 (partial)

Time limit:
1.0s

Memory limit:
256M

Author:

Problem type

Allowed languages

Assembly, Brain****, C, C++, Pascal, Rust

For a while now, ~~show off~~ demonstrate his fast multiplication code, has created a problem that really tests the accuracy and speed of your fast multiplication code.

#### Input Specification

The first line of input will have .

The second line of input will have .

Both and will be non-negative integers strictly less than .

#### Output Specification

Output the product .

#### Sample Input

```
123456123456123456123456123456123456
987987876876765765654654543543432432321321
```

#### Sample Output

`121973153300851295215956247283945278187966162014464020099359068031370037005376`

## Comments

Could NASM and or NASM64 be allowed?

Sure, done.

Hmmm. Is it possible for you to allow Lua on this question? Or is it not possible?