Problem:
 Score : 100 points    Problem Statement Compute A \times B .      Constraints  1 \leq A \leq 100  1 \leq B \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  A  B       Output Print the value A \times B as an integer.        Sample Input 1 2 5      Sample Output 1 10  We have 2 \times 5 = 10 .       Sample Input 2 100 100      Sample Output 2 10000

Solution (Python):
A, B = [int(i) for i in input().split()]
print(A * B)

Solution (Python):
A,B=map(int,input().split())

print(A*B)

Solution (Python):
if __name__ == "__main__":
    a,b = map(int,input().split())
    print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
import sys

import copy



input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**20
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
a,b=rl()
print(a*b)

Solution (Python):
A,B=list(map(int, input().split()))

print(int(A*B))

Solution (Python):

import sys


def solve(A: int, B: int):
    print(A * B)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
a,b=map(int,input('').split(' '))
print(a*b)

Solution (Python):
print(eval(input().replace(" ", "*")))

Solution (Python):
ls = list(map(int, input().split()))

print(ls[0]*ls[1])

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a * b)

Solution (Python):
A, B = list(map(int, input().split()))

print(A*B)

Solution (Python):
A, B = map(int, input().split())

print(A*B)

Solution (Python):
a, b = map(int, input().split())

print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
def main():
    A, B = map(int, input().split())

    print(A * B)


if __name__ == "__main__":
    main()

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
a,b = map(int,input().split())

print(a*b)

Solution (Python):
a,b=map(int,input().split())
c = a * b 
print(c)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A,B=map(int,input().split())
ans=A*B
print(ans)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
n,m=map(int,input().split())
print(n*m)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
A, B = map(int, input().split())
print(int(A*B))

Solution (Python):
A, B = list(map(int, input().split()))

print(A * B)

Solution (Python):
from sys import stdin


def get_result(data):
    A, B = data
    return A * B


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

A, B = map(int, readline().split())
ans = A * B
print(ans)

Solution (Python):
a, b= map(int,input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A*B)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
A,B = (int(x) for x in input().split())
print(A*B)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())

print(a*b)

Solution (Python):
a = input().split()

print(int(a[0])*int(a[1]))

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a, b = map(int, input().split(" "))
print(a*b)

Solution (Python):
def main():
    A, B = [int(x) for x in input().split()]
    print(A * B)

if __name__ == "__main__":
    main()

Solution (Python):
a,b = map(int,input().split())

print(a*b)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
A,B=map(int,input().strip().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())

print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):

def main():
    import sys
    import math
    def input():
        return sys.stdin.readline()[:-1]
    A,B=map(int,input().split())
    print(A*B)
if __name__ == '__main__':
    main()

Solution (Python):
A, B = list(map(int, input().split()))
print(A * B)

Solution (Python):
A,B=map(int, raw_input().split())
print A*B

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
A,B=input().split(' ')
A=int(A)
B=int(B)
print(A*B)

Solution (Python):
A,B=map(int,input().split(' '))

print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a, b = list(map(int, input().split()))

print(a*b)

Solution (Python):
a, b = map(int,input().split())
print(a*b)

Solution (Python):

a,b = map(int,input().split())

print(a*b)

Solution (Python):
nums = input().split(" ")
print(int(nums[0]) * int(nums[1]))

Solution (Python):
A, B = list(map(int, input().split()))

print(A*B)

Solution (Python):
a,b = map(int , input().split())

print(a*b)

Solution (Python):

A,B = map(int,input().split())
print(A*B)

Solution (Python):
A,B=(int(x) for x in input().split())
print(A*B)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
A, B= map(int, input().split())
print(A*B)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):

A, B = map(int,(input().split()))


print(A * B)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
N,K=map(int,input().split())
print(N*K)

Solution (Python):
A, B = list(map(int, input().split()))
print(A * B)

Solution (Python):
a,b = map(int,input().split())
ans = a*b
print(ans)

Solution (Python):
a,b=[int(_) for _ in input().split()]

print(a*b)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
def resolve():
    a,b=map(int,input().split())
    print(a*b)
resolve()

Solution (Python):
a,b=  map(int,input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())

print(A * B)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a,b = [int(e) for e in input().split()]
print(a*b)

Solution (Python):
a, b = map(int, input().split())

print(a * b)

Solution (Python):
def main():
    nums = list(map(int, input().split()))
    n, k = nums[0], nums[1]
    print(n * k)

if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

a, b = map(int, readline().split())

print(a * b)

Solution (Python):
a, b = map(int, input().split())

print(int(a * b))

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
import numpy as np

AB=np.array(input().split(" "),dtype=np.int32)

print(AB[0]*AB[1])

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
x,y = map(int,input().split())	
print(x*y)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(int(A * B))

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())
print(int(a*b))

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
def mul1():
    m,n = map(int,input().split())
    return m*n

if __name__ == "__main__":
    print(mul1())

Solution (Python):
def resolve():
    a, b = list(map(int, input().split()))
    print(a*b)
resolve()

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
def main():
    A, B= map(int, input().split())
    print(A*B)

if __name__ == '__main__':
    main()

Solution (Python):
A,B = map(int,input().split())
print(int(A*B))

Solution (Python):
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math



input = sys.stdin.readline

A, B = map(int, input().split(" "))

print(A*B)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
a,b = map(int,input().split())
c = a*b 
print(c)

Solution (Python):
a,b = map(int,input().split())

print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a = input().split()

print(int(a[0])*int(a[1]))

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    A, B = map(int, input().split())
    print(A*B)

if __name__ == "__main__":
    main()

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    A, B = MI()
    print(A*B)
    


if __name__ == "__main__":
	main()

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
A,B = map(int,input().split())
d = A * B
print(d)

Solution (Python):





















A,B = map(int,input().split())

print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
n, y = map(int, input().split())
print(n*y)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
import sys
sys.setrecursionlimit(700000)

def s_in():
    return input()

def n_in():
    return int(input())

def l_in():
    return list(map(int, input().split()))
a,b=l_in()
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A * B)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
A, B = map(int, input().rstrip().split())
print(A*B)

Solution (Python):
inputs = input().split(" ")
print(int(inputs[0])*int(inputs[1]))

Solution (Python):

a, b = (int(e) for e in input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A * B)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):


def main():
    AB = list(map(int,input().split()))
    print(AB[0]*AB[1])




if __name__ == '__main__':
    main()

Solution (Python):
a = input().split()
b = int(a[0])
c = int(a[1])
print(b*c)

Solution (Python):
A, B = [int(i) for i in input().split()]
print(A*B)

Solution (Python):
a = input().split(" ")
print(int(a[0])*int(a[1]))

Solution (Python):
a = list(map(int, input().split()))
print(a[0] * a[1])

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a,b = map(int ,input().split())
print(int(a*b))

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b=map(int,input().split())

print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A * B)

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

    A,B = map(int,input().split())

    ans = A * B

    print(ans)
    
if __name__ == "__main__":
    main()

Solution (Python):
A,B = map(int,input().split())

print(A*B)

Solution (Python):

A,B =list(map(int,input().split()))

print(A*B)

Solution (Python):
def main():
    A,B = [int(x) for x in input().split()]
    print(A*B)

if __name__ == '__main__':
    main()

Solution (Python):
a = input().split()

print(int(a[0])*int(a[1]))

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())


print(a * b)

Solution (Python):
n,m=map(int,input().split())
print(n*m)

Solution (Python):
A, B = map(int,input().split())
print(A*B)

Solution (Python):
a,b = map(int, input().split())

print(a*b)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
n,m = map(int,input().split())
print(n*m)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
def main():
    N = [int(_) for _ in input().split()]
    print(N[0]*N[1])

if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a , b = list( map( int ,  input().split() )) 
print( a * b )

Solution (Python):
A, B = tuple(map(int, input().split()))
print(A * B)

Solution (Python):


a, b = map(int,input().split())
print(a * b)

Solution (Python):
a,b= map(int,input().split(' '))
print(a*b)

Solution (Python):
a, b = map(int,input().split())
print(a*b)

Solution (Python):
A,B=list(map(int, input().split()))
print(A*B)

Solution (Python):
A,B=map(int,input().split())
ans=A*B
print(ans)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())

print(a*b)

Solution (Python):
def main():
    A, B = map(int, input().split())
    print(A * B)


if __name__ == "__main__":
    main()

Solution (Python):
a,b = map(int,input().split())

ans = a*b
print(ans)

Solution (Python):
s = input().split()
s = [int(i) for i in s]
print(s[0] * s[1])

Solution (Python):
a,b=map(int, input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A * B)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
A, B = [int(x) for x in input().split(" ")]

print(A * B)

Solution (Python):
a, b = map(int, input().split())

print(a*b)

Solution (Python):
import numpy as np;




if __name__ == '__main__':
    a, b = map(int, input().split())
    print(a*b)

Solution (Python):
a,b= map(int, input().split())
print(a*b)

Solution (Python):
a, b=map(int, input().split())

print(a*b)

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD
combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''
def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''
"
def gcd(a, b):
    while b:
        
        
        a, b = b, a % b
    return a

"
def lcm(a, b):
    return a * b // gcd (a, b)

"
def divisor(n):
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table











'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
'''
引数endに任意の文字列を指定すると、その文字列が改行の代わりに最後に挿入される。例えば連続するprint()の出力を改行なしで単純に連結したい場合は空文字列''を指定すればよい。

print('abc', end='---')
print('xyz')


print('abc', end='')
print('xyz')

source: print_basic.py
なお、デフォルトで改行されるのは引数endのデフォルト値が改行文字'\n'に設定されているから。
'''

def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    a,b=map(int, input().split(" "))
    print(a*b)
    
    
    
    
    
    
    


    
    
     

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')
    
    
    
    

    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A,B =map(int, input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A*B)

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
i = list(map(int, input().split()))

print(i[0]*i[1])

Solution (Python):
a, b = map(int, input().split())

print(a * b)

Solution (Python):
A, B = map(int, input().split())

print(A*B)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):











a, b = map(int, input().split())



print(a*b)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):




if(__name__ == '__main__'):
    
    a,b = map(int, input().split(" "))

    ans = a * b

    print(ans)

Solution (Python):
A, B = input().split(' ')

A = int(A)
B = int(B)

print(A * B)

Solution (Python):
a,b=map(int, input().split())
print(a*b)

Solution (Python):
a, b = map(int,input().split())

print(a*b)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
a,b=[int(i) for i in input().split()]
print(a*b)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split(" "))
print(a*b)

Solution (Python):
a, b = (int(x) for x in input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
A, B = map(int, input().split())
ans = A * B
print(ans)

Solution (Python):
a, b = map(int, input().split())

print(a*b)

Solution (Python):
a, b = list(map(int,input().split()))
print(a*b)

Solution (Python):
A,B = map(int, input().split())
print(A*B)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
import sys
max_int = 1000000001  
min_int = -max_int

a, b = map(int, sys.stdin.readline().split())

print(a*b)

Solution (Python):
a, b = map(int, input().split())

print(a*b)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
a,b = map(int,input().split())

print(a*b)

Solution (Python):

import math
import sys

input = sys.stdin.readline

n,k = map(int,input().split())


print(n*k)

Solution (Python):






def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp


def gcd(a,b):
    if a == 0:
        return b
    return gcd(b%a, a)


def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 


def upper_bound(a, x, lo=0):
    hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo


def primefs(n):
    
    primes = {}
    while(n%2 == 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    
    
    return primes


def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 


def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b









def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;




def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x


def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime


MAXN = int(1e6 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    




def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    
    


def int_array():
    return list(map(int, input().strip().split()))

def str_array():
    return input().strip().split();


MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');



a,b = int_array();
print(a*b);

Solution (Python):

import sys


def solve(A: int, B: int):
    print(A*B)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

Solution (Python):
import sys, random, math
from bisect import bisect_left, bisect_right
input = sys.stdin.readline

def main():
    inf = 10 ** 20



    t = 1
    
    for _ in range(1, t+1):
    
        
        a, b = map(int, input().split())
        print(a*b)
        
        
main()

Solution (Python):
Line = [int(s) for s in input().split()]

print(Line[0]*Line[1])

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):

import sys
import numpy as np


def solve(A: int, B: int):
    print(A*B)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())

print(a * b)

Solution (Python):
a,b = map(int, input().split())
print(str(a*b))

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a,b = map(int,input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
a,b = list(map(int,input().split()))

print(a*b)

Solution (Python):
A, B = (int(x) for x in input().split())

print(A*B)

Solution (Python):
a, b = map(int, input().split())

print(a*b)

Solution (Python):
A, B = map(int, input().split())

print(A*B)

Solution (Python):
x1,x2 = [int(s) for s in input().split(" ") ]

print (x1*x2)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
def solve(a, b):
    return a * b


def main():
    a, b = map(int, input().split())
    res = solve(a, b)
    print(res)


def test():
    assert solve(2, 5) == 10
    assert solve(100, 100) == 10000


if __name__ == "__main__":
    test()
    main()

Solution (Python):
A,B = map(int,input().split())


print(A*B)

Solution (Python):
import sys
import copy
from collections import deque
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a, b = na()
print(a*b)

Solution (Python):


a, b = (int(x) for x in input().split())

print(a * b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())

print(A * B)

Solution (Python):

a,b = list(map(int,input().split()))
print(a*b)

Solution (Python):
def solve():
    a, b = map(int, input().split())
    
    

    return a*b
    

print(solve())

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
A,B=map(int, input().split())
print(A*B)

Solution (Python):
a ,b = map(int, input().strip().split())
print(a*b)

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b = mi()
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())
print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
a,b = map(int,raw_input().split(' '))
print a*b

Solution (Python):
A,B=map(int, input().split())
print(A*B)

Solution (Python):
a, b = map(int, input().split(" "))
print( a * b)

Solution (Python):
import sys
input = sys.stdin.readline


def main():
    A, B = map(int, input().split())
    print(A*B)


if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())

print(a * b)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):
A, B= list(map(int, input().split()))
print(A*B)

Solution (Python):
A, B = map(int, input().split())
print(A * B)

Solution (Python):
a, b = map(int, input().split())

print(a * b)

Solution (Python):
A, B = map(int, input().split())

print(A * B)

Solution (Python):

a, b = map(int, input().split())
print(a*b)

Solution (Python):
A,B=map(int,input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A,B = map(int, input().split())
print(A*B)

Solution (Python):
a,b=map(int,input().split())

print(a*b)

Solution (Python):

"""
Created on Sun May 31 20:59:05 2020

@author: NEC-PCuser
"""

A, B = map(int, input().split())

print(A * B)

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
A, B = map(int, input().split())
print(A*B)

Solution (Python):





import sys
import heapq

def main():
    a, b = map(int, sys.stdin.readline().split())
    print(a * b)
    return

if __name__ == "__main__":
    main()

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
A,B = map(int,input().split())

print(A*B)

Solution (Python):
A,B= map(int, input().split())
print(A*B)

Solution (Python):
a, b = map(int, input().split())
print(a*b)

Solution (Python):
a,b=map(int,input().split())
print(a*b)

Solution (Python):
a, b = map(int, input().split())
print(a * b)

Solution (Python):
def solve(a,b):
    return a*b

if __name__ == '__main__':
    a,b = map(int,input().split())
    print(solve(a,b))

Solution (Python):
a,b = map(int, input().split())
print(a*b)

Solution (Python):
A,B=list(map(int,input().split()))

print(A*B)