#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;

#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define repx(i,s,e,d) for(int i=s,i##_end=(e);i<i##_end;i+=d)
#define repxr(i,s,e,d) for(int i=s,i##_end=(e);i>i##_end;i+=d)
#define rept(n) for(int ___i___=0,i##_len=(n);___i___<i##_len;++___i___)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a,0,sizeof(a))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end());
#define CEIL(x, y) (((x) + (y) - 1) / (y))

// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#define DUMPOUT cout
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int> > heapq;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
struct aaa{
    aaa(){
        cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);
    };
}aaaaaaa;

// #define int long long int
// struct S{
//     bool operator<(const S& x) const {
//         return ;
//     }
// };
template<int MOD> struct Modnum {
    lli val;
    constexpr Modnum(lli v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }

    constexpr Modnum operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Modnum operator + (const Modnum& x) const noexcept {
        return Modnum(*this) += x;
    }
    constexpr Modnum operator - (const Modnum& x) const noexcept {
        return Modnum(*this) -= x;
    }
    constexpr Modnum operator * (const Modnum& x) const noexcept {
        return Modnum(*this) *= x;
    }
    constexpr Modnum operator / (const Modnum& x) const noexcept {
        return Modnum(*this) /= x;
    }

    constexpr Modnum& operator += (const Modnum& x) noexcept {
        val += x.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Modnum& operator -= (const Modnum& x) noexcept {
        val -= x.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Modnum& operator *= (const Modnum& x) noexcept {
        val = val * x.val % MOD;
        return *this;
    }
    constexpr Modnum& operator /= (const Modnum& x) noexcept {
        val = val * modinv(x.val).val % MOD;
        return *this;
    }

    constexpr bool operator == (const Modnum& x) const noexcept {
        return val == x.val;
    }
    constexpr bool operator != (const Modnum& x) const noexcept {
        return val == x.val;
    }

    friend constexpr ostream& operator << (ostream &os, const Modnum<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, const Modnum<MOD>& x) noexcept {
        return is >> x.val;
    }
    static constexpr Modnum<MOD> modpow(const Modnum &x, lli n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(x, n / 2);
        t *= t;
        if (n & 1) t *= x;
        return t;
    }
    static constexpr Modnum<MOD> modinv(const Modnum &x) noexcept {
        return modpow(x, MOD - 2);
    }
};

using mi = Modnum<1000000007>;

#define MAX_FAC 1000000
mi fac[MAX_FAC], finv[MAX_FAC];
void init_fac() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    for (int i = 2; i < MAX_FAC; i++) {
        fac[i] = fac[i - 1] * i;
        finv[i] = finv[i - 1] * mi::modinv(i);
    }
}
inline mi com(int n, int k) {
    if (n < k || n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k]);
}
signed main() {
    init_fac();
    int X, Y; cin >> X >> Y;
    if ((2 * X - Y) % 3 + (2 * Y - X) % 3 != 0) {
        cout << 0 << endl;
        return 0;
    }
    int m = (2 * X - Y) / 3, n = (2 * Y - X) / 3;

    cout << com(m + n, n) << endl;
    return 0;
}


Measured memory_bytes: 16128