#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
const int N = 1005;
int l, r, A, B, n, dp[N][36][26][2][3], s[N];
inline int R(int x, int y) { return (x += y) >= MOD ? x - MOD : x; }
inline void ADD(int &x, int y) { x = R(x, y); }
int qpow(int x, int y) {
	int t = 1;
	for (; y; y>>=1) {
		if (y & 1) t = 1ll * t * x % MOD;
		x = 1ll * x * x % MOD;
	} return t;
}
int m, p[N], _p[N], tmp[N];
void BM(int n, int *a) {
	int lst, _d, _m = 0; p[0] = _p[0] = MOD - 1;
	for (int i=0; i<=n; i++) {
		int d = a[i];
		for (int j=1; j<=m; j++)
			d = (d + 1ll * (MOD - p[j]) * a[i-j]) % MOD;
		if (! d) continue;
		if (! m) { m = i + 1, lst = i, _d = MOD - d; continue; }
		int coef = 1ll * d * qpow(_d, MOD - 2) % MOD;
		for (int j=1; j<=m; j++)
			tmp[j] = p[j];
		for (int j=0; j<=_m; j++)
			p[i-lst+j] = (p[i-lst+j] + 1ll * coef * _p[j]) % MOD;
		if (i - lst + _m > m) {
			int _ = m; m = i - lst + _m, lst = i, _d = MOD - d, _m = _;
			for (int j=1; j<=_; j++)
				_p[j] = tmp[j];
		}
	}
}
int x[N], t[N], c[N];
void mul(int * a, int * b) {
	for (int i=0; i<m; i++)
		for (int j=0; j<m; j++)
			c[i+j] = (c[i+j] + 1ll * a[i] * b[j]) % MOD;
	for (int i=m-1<<1; i>=m; i--)
		for (int j=m; ~j; j--)
			c[i-j] = (c[i-j] + 1ll * c[i] * p[j]) % MOD;
	for (int i=0; i<m; i++)
		a[i] = c[i], c[i] = 0;
}
int calc(int y) {
	memset (x, 0, sizeof x), memset (t, 0, sizeof t), x[1] = t[0] = 1;
	for (; y; y>>=1) {
		if (y & 1) mul(t, x);
		mul(x, x);
	} int res = 0;
	for (int i=0; i<m; i++)
		res = (res + 1ll * t[i] * s[i]) % MOD;
	return res;
}
int main() {
	cin >> l >> r >> A >> B;
	for (int j=0; j<=35; j++)
		dp[1][j][1][0][0] = 1 + (j > 9);
	for (int i=1; i<=1000; i++)
		for (int j=0; j<=35; j++)
			for (int k=1; k<26; k++)
				for (int f=0; f<=1; f++)
					for (int t=0; t<=2; t++)
						if (dp[i][j][k][f][t] && (! t && k < A || t && k < B)) {
							for (int x=0; x<=35; x++) {
								if (x == j)
									ADD(dp[i+1][x][!t?k+1:2][f][0], dp[i][j][k][f][t]);
								else if (x == j - 1 && x != 9)
									ADD(dp[i+1][x][t&1?k+1:2][f][1], dp[i][j][k][f][t]);
								else if (x == j + 1 && x != 10)
									ADD(dp[i+1][x][t&2?k+1:2][f][2], dp[i][j][k][f][t]);
								else
									ADD(dp[i+1][x][1][f|j>9^x>9][0], dp[i][j][k][f][t]);
								if (x > 9)
									ADD(dp[i+1][x][1][f|j>9^x>9][0], dp[i][j][k][f][t]);
							}
							if (f)
								s[i] = R(s[i], dp[i][j][k][f][t]);
						}
	for (int i=1; i<=1000; i++)
		s[i] = R(s[i], s[i-1]);
	BM(1000, s);
	cout << R(calc(r), MOD - calc(l - 1));
}