Go: package main

import (
    "fmt"
)

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

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;
}

//#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;
}

C++: #include <stdio.h>

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

C++: #include<bits/stdc++.h>
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 d,c;
	
	scanf("%d %d",&d,&c);
	printf("%d\n",d*c);
	return 0;
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
int main(){
	int d,c;
	cin>>d>>c;
	cout<<d*c<<endl;
}

C++: #include <iostream>

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

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>

int main(){
    int D, C;
    std::cin >> D >> C;

    std::cout << (D*C) << std::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;
typedef long long ll;

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",aB; );
return 0;
}

C++: #include <iostream>
#include <vector>
#include <sstream>

using namespace std;

vector<string> split(const string &s, char delim) {
    vector<string> elems;
    stringstream ss(s);
    string item;
    while (getline(ss, item, delim)) {
        if (!item.empty()) {
            elems.push_back(item);
        }
    }
    return elems;
}

int main() {
    string str;
    getline(cin, str);
    vector<string> splited = split(str, ' ');

    int desk = stoi(splited[0].c_str());
    int chair = stoi(splited[1].c_str());
    cout << desk * chair << 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<stdio.h>

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

C++: #include <cstdio>
using namespace std;
int main() {
    int a, b;
    scanf("%d %d", &a, &b);
    printf("%d\n", a*b);
    return 0;
}

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

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

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    int d, c; cin >> d >> c;
    cout << d*c << "\n";
}

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

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

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

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

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