#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...) 417
#endif
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using f64 = double_t;
using i128 = __int128_t;
constexpr i64 mod = 1000000007;
void add(i64& x, i64 y) {
  if ((x += y) >= mod) { x -= mod; }
}
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(20);
  i64 k;
  string l, r;
  cin >> k >> l >> r;
  int m = 20;
  vector<map<i64, i64>> dp(m + 1);
  dp[0][k] = 1;
  for (int i = 0; i < m; i += 1) {
    for (auto [x, y] : dp[i]) {
      for (int d = 0; d < 10; d += 1) { add(dp[i + 1][x / gcd(d, x)], y); }
    }
  }
  auto f = [&](string s) {
    int n = s.size();
    i64 res = 0;
    i64 p = 1 % k;
    for (int i = 0; i < n; i += 1) {
      for (int j = i ? 0 : 1; j < s[i] - '0'; j += 1) {
        i64 q = p * j % k;
        for (auto [x, y] : dp[n - i - 1]) {
          if (q % x == 0) { add(res, y); }
        }
      }
      p = p * (s[i] - '0') % k;
    }
    add(res, p == 0);
    for (int i = 1; i < n; i += 1) {
      for (int j = 1; j < 10; j += 1) {
        i64 q = j % k;
        for (auto [x, y] : dp[i - 1]) {
          if (q % x == 0) { add(res, y); }
        }
      }
    }
    return res;
  };
  i64 ans = f(r);
  add(ans, mod - f(l));
  i64 check = 1 % k;
  for (char c : l) { check = check * (c - '0') % k; }
  add(ans, check == 0);
  cout << ans;
}