public class Euler638 {
    static final int MOD = 1000000007;
    static int[] fact = new int[51];
    static int[] ifact = new int[51];

    static int mod_add(int a, int b) {
        int s = a + b;
        if (s >= MOD)
            s -= MOD;
        if (s < 0)
            s += MOD;
        return s;
    }

    static int mod_mul(long a, long b) {
        return (int) (a * b % MOD);
    }

    static int mod_pow(int a, long e) {
        long r = 1;
        long x = a;
        while (e > 0) {
            if ((e & 1) != 0)
                r = (r * x) % MOD;
            x = (x * x) % MOD;
            e >>= 1;
        }
        return (int) r;
    }

    static int mod_inv(int a) {
        return mod_pow(a, MOD - 2);
    }

    static {
        fact[0] = 1;
        for (int i = 1; i <= 50; ++i)
            fact[i] = mod_mul(fact[i - 1], i);
        ifact[50] = mod_inv(fact[50]);
        for (int i = 50; i >= 1; --i)
            ifact[i - 1] = mod_mul(ifact[i], i);
    }

    static int binom_small(int n, int k) {
        if (k < 0 || k > n)
            return 0;
        return mod_mul(fact[n], mod_mul(ifact[k], ifact[n - k]));
    }

    static int C(int a, int b, int q) {
        if (a < 0 || b < 0)
            return 0;
        if (a == 0 || b == 0)
            return 1;
        if (q == 1)
            return binom_small(a + b, a);

        int k = Math.min(a, b);
        int m = a + b - k;
        int qm = mod_pow(q, m);

        int denom = 1;
        int numer = 1;
        int qj = 1;

        for (int j = 1; j <= k; ++j) {
            qj = mod_mul(qj, q);
            denom = mod_mul(denom, mod_add(1, -qj));
            numer = mod_mul(numer, mod_add(1, -mod_mul(qm, qj)));
        }

        return mod_mul(numer, mod_inv(denom));
    }

    public static String solve() {
        long ans = 0;
        long ten = 1;
        for (int k = 1; k <= 7; ++k) {
            ten *= 10;
            int n = (int) (ten + k);
            ans = mod_add((int) ans, C(n, n, k));
        }
        return Long.toString(ans);
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}