Go: package main

import (
    "fmt"
)

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

C++: #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
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>
using namespace std;
int main(){
	int a,b;	cin>>a>>b;
	cout<<a*b<<endl;
	return 0;
}

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

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

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcount(n)

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

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

using namespace std;

main(){
	int a,b,c;
	cin >> a >> b;
	c=a*b;
	printf("%d\n",c);
}

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 x,y;
  cin >> x >> y;
  x= x*y;
  cout << x;
  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(){
int a,b;
cin>>a>>b;
cout<<a*b;

}

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

int main(){

int d,c;
cin>>d>>c;
cout<<d*c;
return 0;
}

C++: #include<stdio.h>

int main(void)
{
    int d,c;
    
    scanf("%d %d",d,c);
    
    printf("%d",d*c);
    
    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<stdio.h>
int main(void)
{
		int a,g,h;
		scanf("%d %d",&a,&g);
		h=a*g;
		printf("%d\n",h);
	return 0;
}

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

using namespace std;

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

C++: #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int a,b; cin>>a>>b;
    cout<<a*b<<endl;
}

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

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

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

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

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

C++: #include <iostream>

using namespace std;

int main(){
	int d, c;

	cin >> d >> c;

	cout << d * c << endl;

}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

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


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}