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
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
 
int main() {
    int N, M; cin >> N >> M;
    cout << N * M << endl;
    return 0;
}

