MUL - Fast Multiplication

Multiply the given numbers.

Input

n [the number of multiplications ≤ 1000]

l1 l2 [numbers to multiply (at most 10000 decimal digits each)]

Text grouped in [ ] does not appear in the input file.

Output

The results of multiplications.

Example

Input:
5
4 2
123 43
324 342
0 12
9999 12345

Output:
8
5289
110808
0
123437655

Warning: large Input/Output data, be careful with certain languages


Added by:Darek Dereniowski
Date:2004-06-01
Time limit:1.649s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:ADA95 ASM32-GCC ASM32 BASH C C++ 4.3.2 CPP CPP14 C99 D FORTRAN GO GOSU HASK JAVA JS-RHINO JS-MONKEY LUA PERL PERL6 PHP PYPY PYTHON3 PY_NBC RUBY
Resource:PAL

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.