import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long calc(long h, long w) {
  long ret;
  if (h == 0 || w == 0) {
    ret = 0;
  } else {
    ret = 0;
    const hh = min(h, w);
    ret += (h - hh);
    foreach (k; 0 .. 40) {
      // [2^k, 2^(k+1))
      const a = min(1L << k, hh + 1);
      const b = min(1L << (k + 1), hh + 1);
      if (a < b) {
        ret += w / (1L << k) * (b - a) + min(w % (1L << k), b - a);
      }
    }
  }
  return ret;
}

void main() {
  debug {
    enum INF = 10L^^18;
    enum lim = 20;
    auto dp = new long[][](lim, lim);
    foreach (h; 0 .. lim) foreach (w; 0 .. lim) {
      if (h == 0 || w == 0) {
        dp[h][w] = 0;
      } else {
        dp[h][w] = INF;
        foreach (x; 1 .. w + 1) {
          if (x <= h) {
            chmin(dp[h][w], 1 + dp[h - 1][x] + dp[h][w - x]);
          }
        }
      }
    }
    foreach (h; 0 .. lim) {
      foreach (w; 0 .. lim) {
        writef("%2d ", dp[h][w]);
      }
      writeln();
    }
    foreach (h; 1 .. lim) {
      foreach (w; 1 .. lim) {
        write(dp[h][w] - dp[h - 1][w], " ");
      }
      writeln();
    }
    foreach (h; 1 .. lim) foreach (w; 1 .. lim) {
      if (dp[h][w] != calc(h, w)) {
        writeln(h, " ", w, ": ", dp[h][w], " ", calc(h, w));
        assert(false);
      }
    }
  }
  
  try {
    for (; ; ) {
      const H = readLong();
      const W = readLong();
      
      const ans = calc(H, abs(W));
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}