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 <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm> // sort
#include <math.h>

#define DEBUG 0

#define REP(i, n) for (long long i = 0; i < (n); i++) 
typedef long long ll;
static const ll mod = 1000000007;
static const ll INF = 1000000000000000000LL;
                    //999999997000000003
                    //1000000000000000000

using namespace std;

int main(){
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    int N,M;
    cin >> N >> M;

    int res = N * M;
    cout << res << endl;
    return 0;
}

