#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>


#define INF 4000000000000000000LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)


class point_t
{
public:
  point_t(int xx = 0, int yy = 0) : x(xx), y(yy) {};

public:
  bool operator==(const point_t& p) const {
    return x == p.x && y == p.y;
  };

  bool operator!=(const point_t& p) const {
    return ! (*this == p);
  };

public:
  int x;
  int y;
};


class modint_t;


modint_t modpow(modint_t x, long long y);


class modint_t {
  friend std::ostream& operator<<(std::ostream& ofs, const modint_t a);

public:
  modint_t(long long xx = 0) : x(xx % MOD) {};

public:
  long long get() {
    normalize();

    return x;
  };

public:
  bool operator==(modint_t a) const {
    return x == a.x;
  };

  bool operator!=(modint_t a) const {
    return ! (*this == a);
  };

public:
  modint_t operator+(const modint_t& a) const {
    return (x + a.x) % MOD;
  };

  modint_t operator-(const modint_t& a) const {
    return (x - a.x) % MOD;
  };

  modint_t operator*(const modint_t& a) const {
    return x * a.x % MOD;
  };

  modint_t operator/(const modint_t& a) const {
    return (*this) * a.inversed();
  };

  // Note that operator^'s priority is quite low in C++...
  modint_t operator^(long long i) const {
    return modpow(x, i);
  };

public:
  modint_t& operator+=(const modint_t& a) {
    (x += a.x) %= MOD;

    return *this;
  };

  modint_t& operator-=(const modint_t& a) {
    (x -= a.x) %= MOD;

    return *this;
  };

  modint_t& operator*=(const modint_t& a) {
    (x *= a.x) %= MOD;

    return *this;
  };

  modint_t& operator/=(const modint_t& a) {	// Not tested
    (x *= a.inversed().x) %= MOD;

    return *this;
  };

public:
  modint_t inversed() const {
    assert(x % MOD);

    return modpow(x, MOD - 2);
  };

  void inverse() {
    assert(x % MOD);

    x = modpow(x, MOD - 2).x;
  };

private:
  void normalize() {
    while (! (0 <= x && x < MOD))
      x = (x + MOD) % MOD;
  };

private:
  long long x;
};

modint_t operator+(long long a, const modint_t& b)
{
  return modint_t(a) + b;
}

modint_t operator-(long long a, const modint_t& b)
{
  return modint_t(a) - b;
}

modint_t operator*(long long a, const modint_t& b)
{
  return modint_t(a) * b;
}

modint_t operator/(long long a, const modint_t& b)
{
  return modint_t(a) / b;
}

std::ostream& operator<<(std::ostream& ofs, modint_t a)
{
  a.normalize();

  ofs << a.x;

  return ofs;
}

modint_t modpow(modint_t x, long long y)
{
  modint_t xx = x, p = 1;

  for ( ; y; xx *= xx, y >>= 1)
    if (y & 1)
      p *= xx;

  return p;
}

modint_t modncr(int n, int r)
{
  assert(n >= 0);
  assert(r >= 0);

  if (n == 0)
    return r == 0 ? 1 : 0;

  if (r > n)
    return 0;

  modint_t num = 1, denom = 1;

  int dm = std::min(r, n - r);
  int dp = std::max(r, n - r);

  for (int i = dp + 1; i <= n; i ++)
    num *= i;

  for (int i = 2; i <= dm; i ++)
    denom *= i;

  return modpow(denom, MOD - 2) * num;
}


int main(int argc, char** argv)
{
  std::cin.tie(0);
  std::ios_base::sync_with_stdio(0);

  std::cout << std::fixed << std::setprecision(6);
  std::cerr << std::fixed << std::setprecision(6);

  point_t P, pl, pu;

  std::cin >> P.x >> P.y;

  int x = 0, y = 0;

  while (pl != P) {
    if (pl.x > P.x || pl.y > P.y || pu.x > P.x || pl.y > P.y) {
      std::cout << 0 << std::endl;

      return 0;
    }

    pl.x += 2;
    pl.y += 1;

    while (1) {
      int dx = P.x - pl.x, dy = P.y - pl.y;

      if (dy <= dx * 2)
        break;

      pl.x --;
      pl.y ++;

      x ++;
    }

    pu.x += 1;
    pu.y += 2;

    while (1) {
      int dx = P.x - pu.x, dy = P.y - pu.y;

      if (dx <= dy * 2)
        break;

      pu.x ++;
      pu.y --;
    }

    y ++;
  }

  std::cout << modncr(y, x) << std::endl;
  
  return 0;
}


Measured memory_bytes: 256