Block Towers

Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.

The students don’t want to use too many blocks, but they also want to be unique, so no two students’ towers may contain the same number of blocks. Find the minimum height necessary for the tallest of the students’ towers.

Input
The first line of the input contains two space-separated integers n and m (0 ≤ n, m ≤ 1 000 000, n + m > 0) — the number of students using two-block pieces and the number of students using three-block pieces, respectively.

Output
Print a single integer, denoting the minimum possible height of the tallest tower.

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<mem.h>
using namespace std;
#define ll long long

int main()
{
	ll n,m;
	scanf("%lld%lld",&n,&m);
	ll m2 = n*2, m3 = m*3;
	for(int i = 6; i <= min(m2, m3); i += 6)
	{
		if(m2 > m3)
		{
			m3 += 3;
		}
		else
		{
			m2 += 2;
		}
	}
	printf("%lld\n",m2 > m3?m2:m3);
}