Go: package main

import (
    "fmt"
)

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

C++: #include<bits/stdc++.h>
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;
return 0;
}

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

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

int main() {
	int d=0,c=0;
	cin>>d>>c;
	cout<<d*c<<endl;
	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<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 d,c;
   cin>>d>>c>>;
   cout<<d*c<<endl;
return 0;
}

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

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

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))

typedef long long int ll;

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 d,c;
cin>>d>>c;
cout<<d*c<<endl;

return 0;
}

C++: #include<iostream>
using namespace std;
int main(){

    int n,m;
    cin >> n >> m;
    cout << n*m << endl;
}

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

C++: #include <iostream>
 
int main(){
  int n, m;
   
  std::cin >> n >> m;
 
  std::cout << n * m << std::endl;
}

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

int main(){
int d;
int c;

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

return 0;

}

C++: #include<cstdio>

int main(void){
	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<<"\n";
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<set>
#include<string>
#include<vector>
#include<queue>

using namespace std;

//1
int main(){
	int d, c;
	cin >> d >> c;

	cout << d*c << endl;

	return 0;
}

/*
//2
int main(){


	return 0;
}
*/

/*
//3
int main(){


	return 0;
}
*/

/*
//4
int main(){


	return 0;
}
*/

//=====

/*
//5
int main(){


	return 0;
}
*/

/*
//6
int main(){


	return 0;
}
*/

/*
//7
int main(){


	return 0;
}
*/

/*
//8
int main(){


	return 0;
}
*/

/*
//9
int main(){


	return 0;
}
*/

/*
//10
int main(){


	return 0;
}
*/

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

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

C++: #include <iostream>

using namespace std;

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

int main()
{
	solve();
	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;
	
}

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

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

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

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

C++: #include <iostream>
using namespace std;
int main(){
  int 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);
}

C++: #include<iostream>
using namespace std;
main(){
  int a,b;
  cin>>a>>b;
  cout<<a*b<<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>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
 
int main() {
  int a, b; cin >>a >>b;
  cout <<a * b <<endl;
  return 0;
}

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

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

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

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

    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
using namespace std;
int main() {
	int d, c;
	scanf("%d%d", &d, &c);
	printf("%d\n", (c*d));
}

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

C++: #include<iostream>

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

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

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

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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}

inline void fast_io(){ios_base::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple

int main()
{
  cout << in() * in() << endl;
  return 0;
}