uva10970

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 307,maxm = 1e9;
int d[maxn][maxn] = {0},m,n;

int dp(int r, int c) {
	if (d[r][c]) return d[r][c];
	if (r == 1) return d[r][c] = c - 1;
	if (c == 1) return d[r][c] = r - 1;

	int& ans = d[r][c];
	ans = maxm;

	for (int i = 1; i <= r >> 1; i++) {
		ans = min(ans, dp(i, c) +  dp(r - i, c) +1 );
	}
	for (int i = 1; i <= c >> 1; i++) {
		ans = min(ans, dp(r, i) + dp(r, c - i) + 1);
	}
	return ans;
}

int main()
{
	dp(300, 300);
	while (cin >> m >> n) {
		cout << d[m][n] << endl;
	}
	return 0;
}