#include <iostream>
#include <map>
#include <set>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <random> //mt19937 mtrand(time(0));
#include <string>
#include <time.h>
#include <vector>
#include <cstring>
#include <iomanip> //fixed<<setprecision(12)<<
#include <utility> //pair模板,std::move()
#include <assert.h>
#include <algorithm>
#include <unordered_map>
#define QAQ 0
#define endl '\n'
#define close                         \
    std::ios::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const db pi = acos(-1);
const db eps = 1e-7;
const int inf = 1e9;
const ll INF = 2e18;
const int N = 1e6 + 7;
const int M = 5e6 + 7;
const int mod = 998244353;
const int base = 131;
using namespace std;
//

void solve()
{
    //	freopen("data.in.txt","r",stdin);
    //	freopen("data.out.txt","w",stdout);
    int n,m;
    cin>>n>>m;
    cout<<6ll*n*m<<endl;
}

signed main()
{
    close;
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return QAQ;
}