C. Block Towers

题目连接：

Description

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.

Sample Input

1 3

Sample Output

9

Hint

题意

有n个人在用2的倍数，有m个人在用3的倍数，所有人的数都要求不一样

你要使得最大数最小，然后问你这个答案是多少

题解：

我感觉贪心要挂……

所以直接瞎暴力二分就好了，check是O(1)的

我们讨论一下2的倍数，3的倍数，6的倍数就好了

代码

#include
    
     using namespace std;int n,m;bool check(int k){    int num1 = k/2;    int num2 = k/3;    int num3 = k/6;    if(n>num1)return false;    if(m>num2)return false;    int d = min(num1-n,num3);    if(d+(num2-num3)