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 ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init));

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;

const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll a,b;
  cin >> a>>b;
  cout << a * b << 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 <cstdio>

using namespace std;

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

C++: #include <iostream>

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

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

int main() {
  int d, c;

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

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

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

#define INF (1 << 30)
#define INFL (1LL << 62)
#define MOD7 1000000007
#define MOD9 1000000009
#define EPS 1e-10

#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pul pair<ull, ull>
#define all(a) (a).begin(), (a).end()
#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)

void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void yes() { cout << "yes" << endl; }
void no() { cout << "no" << endl; }
void Taka() { cout << "Takahashi" << endl; }
void Aoki() { cout << "Aoki" << endl; }
void digit(int d) { cout << fixed << setprecision(d); }
void IOup() { cin.tie(0); ios::sync_with_stdio(false); }

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

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

C++: #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define whole(xs) xs.begin(), xs.end()

int d, c;
void input() {
    cin >> d >> c;
}

void solve() {
    cout << d * c << endl;
}

int main() {
    input(); solve();
    return 0;
}

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

typedef long long ll;
typedef pair<ll, ll> P;

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define dep(i, a, n) for(int i = a; i >= (n); i--)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000000

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

signed main() {
	ll 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++: a,b=map(int,input().split())
print(a*b)

C++: #include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <random>
#include <queue>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int a,b;cin >> a >> b;
	cout << a*b << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()

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

C++: #include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define rep(i,n) for(int i=0; i<int(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

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",a*b);
 return 0;
}

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

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

C++: #include <cstdio>
#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<<'\n';
  return(0);
}