Go: package main

import (
    "fmt"
)

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

C++: #include <iostream>

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

C++: /*
 * 0295.cc: The Number of Chairs
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

/* typedef */

/* global variables */

/* subroutines */

/* main */

int main() {
  int d, c;
  cin >> 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;

	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 a=0;
	int b=0;
	cin>>a>>b;
	a*=b;
	cout<<a;
}

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

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

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

C++: # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
const char dir[4] = { 'u','l','d','r' };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)

int n, m;

int main() {
	cin >> n >> m;
	cout << n*m << endl;
}

C++: #include <iostream>

using namespace std;

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

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

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

C++: #include <cstdio>

using namespace std;

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

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& input, vector<T>& v) { for (auto& elemnt : v)input >> elemnt; return input; }

int main() {
    init();

    int d, c;
    cin >> d >> c;
    cout << d * c << "\n";
}

C++: #include <iostream>

using namespace std;

int main(){
    int n, m;
    cin >> n >> m;
    cout << n*m << endl;
}

C++: #include<stdio.h>
int main(void)
{
	int d, c, x;
	scanf("%d",&d);
	scanf("%d",&c);
	x = d * c;
	printf("%d\n",x);
	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 n,m;cin>>n>>m;cout<<n*m<<endl;return 0;}

C++: n;main(m){scanf("%d%d",&n,&m);n*=m;!vprintf("%d\n",&n);exit(0);}

C++: #include <stdio.h>
#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;
}

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 d;
int c;

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

C++: #include <iostream>

using namespace std;

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

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

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int,P> P3;
const ll MOD = ll(1e9+7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-6;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef pair<ll,ll> pll;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
#define MOD 1000000007
#define ARRAY_MAX 100005

const int INF = 1e9+7;


int main(){

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


    return 0;
}

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

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

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
int main() {
	int d, c; cin >> d >> c;
	cout << d*c << endl;

	return 0;
}