#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> vec;
bool flag;
long long mod = 1e9 + 7;
long long dp[N];
void init() {
  vec.clear();
  flag = false;
}
void test() {
  dp[0] = 1;
  dp[1] = 1, dp[2] = 2;
  for (int i = 3; i < N; ++i) dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
int main() {
  int a, b;
  while (cin >> a >> b) cout << a * b << endl;
  return 0;
}
