Oranges on Cans

square1001 You put a $ N $ can of aluminum on the table.

E869120 You put $ M $ of oranges on each aluminum can on the table.

How many oranges are on the aluminum can?

input

Input is given from standard input in the following format.


$ N $ $ M $


output

Output the number of oranges on the aluminum can in one line.

However, insert a line break at the end.

Constraint

* $ 1 \ leq N \ leq 9 $
* $ 1 \ leq M \ leq 9 $
* All inputs are integers.



Input example 1


3 4


Output example 1


12


Input example 2


7 7


Output example 2


49






Example

Input

3 4


Output

12
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
#include<complex>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;




const ll INF = 1e9;


/******************************************************************************************/


int main() {

	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(10);

	

	int n, m;
	cin >> n >> m;
	cout << n * m << endl;


	return 0;
}

