rt，样例都没过

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 10;

typedef long long ll;

int k, a[20];

ll dp[20][20][20][2];

ll dfs(int p, int pr1, int pr2, bool i3, bool lim) {
	if (!p) return i3;
	if (!lim && ~dp[p][pr1][pr2][i3]) return dp[p][pr1][pr2][i3];
	int n = lim ? a[p] : 9;
	ll res = 0;
	for (int i = 0; i <= n; i++) {
		if (i == 4 || i == 8) continue;
		res += dfs(p - 1, i, pr1, i3 || (i == pr1 && i == pr2), lim && i == a[p]);
	}
	if (!lim) dp[p][pr1][pr2][i3] = res;
	return res;
}

inline 
ll solve(ll x) {
	memset(dp, -1, sizeof dp);
	k = 0;
	while (x) a[++k] = x % 10, x /= 10;
	ll res = 0;
	for (int i = 1; i <= a[k]; i++) {
		if (i == 4 || i == 8) continue;
		res += dfs(k - 1, i, 0, 0, i == a[k]);
	}
	return res;
}

ll l, r;

int main() {
	scanf("%lld%lld", &l, &r);
	printf("%lld", solve(r) - solve(l - 1));
}