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 in C++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define all(v) v.begin(),v.end()
#define mp make_pair
#define mm(a) memset(a,true,sizeof(a))
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define repn(i,a,b) for(ll i = a; i >= b; i--)
#define pb push_back
#define ff first
#define ss second
#define fto(k,m) for(auto k:m)
#define in_edges(m) repp(i, 1, m){ ll a, b; cin >> a >> b; adj[a].pb(b), adj[b].pb(a);}
#define debug(this) cerr<<"> "<<#this<<" : "<<this<<"\n"
#define MOD 1000000000000000007
#define sz(a) ll((a).size())
#define pii 3.14159265358979
#define ld long double
ll power(ll x, ll y)
{
	// x raised to power y ke liye ->: power(x,y);
    ll res = 1; x %= MOD;
    while(y > 0){if(y & 1) res = (res*x) % MOD; y = y>>1, x = (x*x) % MOD;} 
    return res;
}
const int k = 32;
vector<ll> arr;
void calcpower()
{
	rep(i,0,k)
	{
		arr.pb(1<<i);
	}
}
void show()
{
	for(auto k:arr)cout<<k<<" ";
}
bool ok(ll h)
{
	ll l = 0,r = k;
	while(l<=r)
	{
		ll mid = l+(r-l)/2;
		if(h==arr[mid])return true;
		else if(arr[mid]>h)
		{
			r = mid-1;
		}
		else l = mid+1;
	}
	return false;
}
int main()
{
	// freopen("in.txt","r",stdin);
	// freopen("out","w",stdout);
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ll t;t=1;
	// BAhUT KHUSI ,MILI YE QUESTION BANAKE
	// cin >> t;
	while(t--)
	{
		ll n,m; cin >> n>>m;
		cout<<1ll*n*m;
	}
}