#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

using namespace std;

template <int M, bool IsPrime = false> class Modulo {
  int n;
  static typename std::enable_if<IsPrime, ll>::type inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
  }

public:
  Modulo() : n(0) { ; }
  Modulo(int m) : n(m) {
    if (n >= M)
      n %= M;
    else if (n < 0)
      n = (n % M + M) % M;
  }
  Modulo(ll m) {
    if (m >= M)
      m %= M;
    else if (m < 0)
      m = (m % M + M) % M;
    n = m;
  }
  explicit operator int() const { return n; }
  explicit operator ll() const { return n; }
  bool operator==(const Modulo &a) const { return n == a.n; }
  Modulo &operator+=(const Modulo &a) {
    n += a.n;
    if (n >= M) n -= M;
    return *this;
  }
  Modulo &operator-=(const Modulo &a) {
    n -= a.n;
    if (n < 0) n += M;
    return *this;
  }
  Modulo &operator*=(const Modulo &a) {
    n = (ll(n) * a.n) % M;
    return *this;
  }
  Modulo operator+(const Modulo &a) const {
    Modulo res = *this;
    return res += a;
  }
  Modulo operator-(const Modulo &a) const {
    Modulo res = *this;
    return res -= a;
  }
  Modulo operator-() const { return Modulo(0) - *this; }
  Modulo operator*(const Modulo &a) const {
    Modulo res = *this;
    return res *= a;
  }
  Modulo operator^(int m) const {
    if (m == 0) return Modulo(1);
    const Modulo a = *this;
    Modulo res = (a * a) ^ (m / 2);
    return m % 2 ? res * a : res;
  }
  typename std::enable_if<IsPrime, Modulo>::type
  operator/(const Modulo &a) const {
    return *this * inv(ll(a), M);
  }
  typename std::enable_if<IsPrime, Modulo>::type operator/=(const Modulo &a) {
    return *this *= inv(ll(a), M);
  }
};

template <int M, bool IsPrime = false> bool is_zero(Modulo<M, IsPrime> x) {
  return int(x) == 0;
}
template <int M, bool IsPrime = false> int abs(Modulo<M, IsPrime> x) {
  return int(x);
}

const int mod = 1000000007;

template <int M = mod> Modulo<M, true> fact(int n, bool sw = true) {
  static std::vector<Modulo<M, true>> v1 = { 1 }, v2 = { 1 };
  if (n >= (int)v1.size()) {
    const int from = v1.size(), to = n + 1024;
    v1.reserve(to);
    v2.reserve(to);
    for (int i = from; i < to; ++i) {
      v1.push_back(v1.back() * Modulo<M, true>(i));
      v2.push_back(v2.back() / Modulo<M, true>(i));
    }
  }
  return sw ? v1[n] : v2[n];
}

template <int M = mod> Modulo<M, true> comb(int a, int b) {
  if (b < 0 || b > a) return 0;
  return fact<M>(a, true) * fact<M>(b, false) * fact<M>(a - b, false);
}

using Mod = Modulo<mod, true>;

int n, x, y, z;
unordered_map<ll, Mod> memo[41];
Mod not_xyz(int left, int sum, ll log) {
  if(sum > x + y + z) {
    return not_xyz(left, sum - log % 10, log / 10);
  }
  if(memo[left].count(log)) return memo[left][log];
  if(sum == x + y + z) {
    int xl=x, yl=y, zl=z;
    for(ll k=log; k; k /= 10) {
      if(xl) {
        xl -= k % 10;
        if(xl < 0) {
          return not_xyz(left, sum - log % 10, log / 10);
        }
      } else if (yl) {
        yl -= k % 10;
        if(yl < 0) {
          return not_xyz(left, sum - log % 10, log / 10);
        }
      } else {
        return memo[left][log] = 0;
      }
    }
  }
  if(left == 0) return 1;
  Mod answer = 0;
  ll succ = 1;
  while(succ <= log) succ *= 10;
  FOR(i, 1, 8){
    answer += not_xyz(left - 1, sum + i, log + i * succ);
  }
  answer += not_xyz(left - 1, 0, 0) * 3;
  return memo[left][log] = answer;
}

int main(void)
{
  cin >> n >> x >> y >> z;
  cout << ll((Mod(10) ^ n) - not_xyz(n, 0, 0)) << endl;
  return 0;
}


Measured memory_bytes: 110432