Go: package main

import (
    "fmt"
)

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

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>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <utility>
#include <climits>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define F first
#define S second
#define OUT(x) cout << x << "\n"
#define int long long
using namespace std;
using point = pair< int,int >;

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

    OUT(d * c);
    return 0;
}

C++: #include <bits/stdc++.h>
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*2=c<<endl:
}

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<bits/stdc++.h>
using namespace std;

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

C++: #include <stdio.h>

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

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

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<queue>
#include<cmath>
#include<algorithm>
using namespace std;
struct Puzzle {
	int x[4][4];
};
queue<pair<Puzzle, int>>Q; Puzzle Z;
int manh(Puzzle y) {
	int sum = 0; pair<int, int> p[16];
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			p[y.x[i][j]] = make_pair(i, j);
		}
	}
	for (int i = 0; i < 16; i++) {
		int X = (i - 1) / 4, Y = (i - 1) % 4;
		if (i == 0) { X = 3; Y = 3; }
		sum += abs(X - p[i].first) + abs(Y - p[i].second);
	}
	return sum;
}
int main() {
	int cnt = 0;
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			cin >> Z.x[i][j];
		}
	}
	Q.push(make_pair(Z, 0));
	while (!Q.empty()) {
		Puzzle r = Q.front().first;
		Puzzle s; int V = Q.front().second;
		pair<int, int>z; Q.pop(); cnt++;
		for (int i = 0; i < 4; i++) {
			for (int j = 0; j < 4; j++) {
				if (r.x[i][j] == 0) z = make_pair(i, j);
			}
		}
		int dx[4] = { 0,1,0,-1 };
		int dy[4] = { 1,0,-1,0 };
		for (int i = 0; i < 4; i++) {
			for (int j = 0; j < 4; j++) {
				for (int k = 0; k < 4; k++)s.x[j][k] = r.x[j][k];
			}
			int px = z.first + dx[i], py = z.second + dy[i];
			if (py < 0 || py > 3)continue;
			if (px < 0 || px > 3)continue;
			swap(s.x[z.first][z.second], s.x[px][py]);
			if (manh(r) >= manh(s) - 2) {
				int OK = 1;
				for (int j = 0; j < 4; j++) {
					for (int k = 0; k < 4; k++) {
						if (s.x[j][k] != (j * 4 + k + 1) % 16) OK = 0;
					}
				}
				if (OK) {
					cout << V + 1 << endl;// cout << ' ' << cnt << endl;
					return 0;
				}
				Q.push(make_pair(s, V + 1));
			}
		}
	}
	return 0;
}

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

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, 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);
	d=d*c;
	printf("%d\n",d);
	return 0;
}

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

int main(){

  int d, c;
  cin >> d >> c;

  cout << d * c << endl;

}

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

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

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

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

}

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>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define fi first
#define se second
typedef pair<int,int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;

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

C++: #include<bits/stdc++.h>
#include<vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i,N) for(int i=0;i<N;i++)

using namespace std;

int main(void){
    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 <bits/stdc++.h>
using namespace std;

int main() {
    int c, d; cin >> c >> d;
    cout << c*d << 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(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a*b);
return 0;
}

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

int main() {
  int a, b;
  scanf("%d%d", &a, &b);
  cout << a * b<< endl;
  return 0;
}

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

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

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

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

C++: #include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010;
int dx[5]={0,1,0,-1,0};
int dy[5]={1,0,-1,0,0};
int 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 >> d>>c;
    a = c*d;
    cout << a;
    
}

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>
using namespace std;

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

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>

using namespace std;
using LL = long long;

constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <vector>
#include <cstdio>
using namespace std;
int main(){
	int n, d;
	cin >> n >> d;
	cout << n * d;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{

  int c,d;

  cin >> c >> d;

  cout << c*d << endl;

}