#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <numeric>
#include <assert.h>
using namespace std;
#define int long long
#define vc vector
#define pb emplace_back
#define be(x) x.begin(), x.end()
#define be1(x) x.begin() + 1, x.end()
#define lowbit(x) (x & -x)
#define sz(x) (int)x.size()
#define L(i, j, k) for (int i = j; i <= k; i++)
#define R(i, j, k) for (int i = j; i >= k; i--)
#define YES(x) (cout << ((x) ? "YES" : "NO") << endl)

const int inf = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;

signed main()
{
    ios::sync_with_stdio(0), cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    cout << n * m * 6 << endl;
    return 0;
}