Go: package main

import (
    "fmt"
)

func main() {
    var a, b float64
    fmt.Scanf("%v %v", &a, &b)
    fmt.Println(a * b)
}

C++: #define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

int main(){
    int a,b;
    cin >> a >> b;
    cout << a*b << endl;
}

C++: #include <iostream>
using namespace std;
int main() {
	int a, b;
	cin >> a >> b;
	cout << a*b << endl;
	return 0;
}

C++: #include <iostream>

template<typename T>
inline T input(){T t; std::cin >> t; return t;}

int main(){
    std::ios::sync_with_stdio(false);
    auto d = input<int>();
    auto c = input<int>();
    std::cout << d * c << std::endl;
}

C++: #include<iostream>
using namespace std;

int main(){
  int d,c;
  cin >> d >> c;
  cout << d*c << endl;
}

C++: #include <bits/stdc++.h>

#define REP(i ,n) for(int i=0 ;i < n; i++)
#define REPB(i ,n) for(int i=n; i >= 0; i--)
#define FOR(i ,m ,n) for(int i=m; i < n; i++)
#define FORB(i, m, n) for(int i=m; i>= n; i--)
#define ll long long
#define pb push_back
#define popb pop_back
#define debug(i) cout << i << endl
using namespace std;
int main(){
  int d, c;
  cin >> d >> c;

  cout << (d * c) << endl;
}

C++: #include <iostream>
using namespace std;

int main() {
  int d, c; cin >> d >> c;
  cout << d * c << endl;
  return 0;
}

C++: #include <cstdio>

int main() {
  int d, c;
  scanf("%d %d", &d, &c);
  
  printf("%d\n", d * c);
  
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b;
    cin>>a>>b;
    cout<<a*b<<endl;
    
}

C++: #include <iostream>
using namespace std;


int main(void){

int ans,d,c;

cin >> d >>c;

ans = d *c;
 cout  << ans  << endl;

}

C++: #include <stdio.h>
int main(){
  int d,c;
  scanf("%d %d",&d,&c);
  printf("%d\n",d*c);
  return 0;
}

C++: #include <iostream>

using namespace std;
int main() {
    int d, c;
    cin >> d >> c;
    cout << d * c << endl;
    return 0;
}

C++: include<iostream>
using namespace std;

int main(){

int a,b;
cin>>a>>b;
cout<<a*b<<endl;

return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int d,c;
cin>>d>>c;
cout<<d*c<<endl;
         return 0;
      }

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	int a,b;
	cin>>a>>b;cout<<a*b<<endl;
}

C++: #include<iostream>
int main(){
    int N,M;
    std::cin >> N >> M;
    std::cout << N*M << std::endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    
    int a,b;
    cin >>a>>b;
    cout<<a*b<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
  int d,c;

  cin>>d>>c;

  cout<<d*c<<"\n";

  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b;    cin>>a>>b;
    cout<<a*b<<endl;
    return 0;
}

C++: #include <iostream>
using namespace std;
int main() {
  int d ,c;
  cin >> d >> c;
  cout << d*c<< endl;
}

C++: #include<iostream>
using namespace std;

int main(){
   int d,c;
   cin>>d>>c;
   cout<<d*c<<endl;
return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a,b;
	scanf("%d %d",&a,&b);
	printf("%d\n",a*b);
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
  int d, c;

  cin >> d >> c;

  cout << d * c << endl;

  return 0;
}

C++: #include <iostream>
using namespace std;

int d, c;

int main(){
	cin >> d >> c;
	cout << d * c << endl;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int a,b;
    cin>>a>>b;
    cout<<a*b<<endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int d;	cin >> d;
	int c;	cin >> c;

	cout << d * c << endl;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main () {

	int d, c;

	cin >> d >> c;

	

	cout << d * c << endl;

	return 0;
}

C++: #include<iostream>
using namespace std ;

main(){
	int d,c ;
	cin >> d >> c ;
	cout << d*c << endl ;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    int a,c,d
    cin >>c>d;
    a = c*d;
    cout << a;
    
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){

	int d, c;
	cin>>d>>c;
	cout<<d * c<<endl;

	return 0;
}

C++: //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;


// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// ???
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T>
void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C>
void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion


int main()
{
    int a, b;
    cin >> a >> b;
    P(a*b);
    return 0;
}