MULTIPLY - Fast Multiplication Again

After trying to solve Problem Number 31 (Fast Multiplication) with some script languages that support arbitrary large integers and timing out, you wonder what would be the best language to do fast multiplication of integers. And naturally it comes to your mind: Of course it is brainf**k, because there are only very cheap operations in that language.

Input

Two positive integers, ended with a line feed (ASCII 10) each.

Output

The product of the two integers, terminated by a line feed. You may assume that this number will be less than 10000.

Example

Input:
1
2

Output:
2

Added by:overwise
Date:2004-07-21
Time limit:0.200s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:BF

hide comments
2012-07-31 17:13:49 (Tjandra Satria Gunawan)(曾毅昆)
Easy, just scan A and B then print A*B. "Just Kidding"
Got AC on first try ;D
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.