#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1'000'000'007;

constexpr int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
constexpr int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }

int d[30];

int step[30][2][57][36][25][21], stepc;
int dp[30][2][57][36][25][21];

void subD(int x, int &c2, int &c3, int &c5, int &c7) {
  int cur2 = 0, cur3 = 0, cur5 = 0, cur7 = 0;
  if (x == 0)
    cur2 = 7122, cur3 = 7122, cur5 = 7122, cur7 = 7122;
  else if (x == 2)
    cur2 = 1;
  else if (x == 3)
    cur3 = 1;
  else if (x == 4)
    cur2 = 2;
  else if (x == 5)
    cur5 = 1;
  else if (x == 6)
    cur2 = 1, cur3 = 1;
  else if (x == 7)
    cur7 = 1;
  else if (x == 8)
    cur2 = 3;
  else if (x == 9)
    cur3 = 2;
  c2 = max(0, c2 - cur2);
  c3 = max(0, c3 - cur3);
  c5 = max(0, c5 - cur5);
  c7 = max(0, c7 - cur7);
}

int go(int n, bool any, int c2, int c3, int c5, int c7) {
  if (n == -1)
    return c2 + c3 + c5 + c7 == 0;
  if (step[n][any][c2][c3][c5][c7] == stepc)
    return dp[n][any][c2][c3][c5][c7];
  step[n][any][c2][c3][c5][c7] = stepc;
  int ret = 0;
  for (int x = 0; x < 10; ++x) {
    if (not any and x > d[n])
      break;
    int cur2 = c2, cur3 = c3, cur5 = c5, cur7 = c7;
    subD(x, cur2, cur3, cur5, cur7);
    ret = add(ret, go(n - 1, any or x < d[n], cur2, cur3, cur5, cur7));
  }
  return dp[n][any][c2][c3][c5][c7] = ret;
}

int step0[30][2][2];
int dp0[20][2][2];

int solve0(int n, bool any, bool has0) {
  if (n == -1)
    return has0;
  if (step0[n][any][has0] == stepc)
    return dp0[n][any][has0];
  step0[n][any][has0] = stepc;
  int ret = 0;
  for (int x = 0; x < 10; ++x) {
    if (not any and x > d[n])
      break;
    ret = add(ret, solve0(n - 1, any or x < d[n], has0 or (x == 0)));
  }
  return dp0[n][any][has0] = ret;
}

using i128 = __int128;

i128 Parse(string_view s) {
  i128 r = 0;
  for (auto c : s)
    r = r * 10 + c - '0';
  return r;
}

int solve(int64_t k, i128 b) {
  if (b == 0)
    return 0;
  int c2 = 0, c3 = 0, c5 = 0, c7 = 0;
  while (k % 2 == 0) {
    k /= 2;
    c2++;
  }
  while (k % 3 == 0) {
    k /= 3;
    c3++;
  }
  while (k % 5 == 0) {
    k /= 5;
    c5++;
  }
  while (k % 7 == 0) {
    k /= 7;
    c7++;
  }

  int n = 0;
  while (b) {
    d[n++] = b % 10;
    b /= 10;
  }
  d[n] = 0;
  stepc += 1;

  int ret = 0;

  if (k > 1) {
    for (int i = n - 1; i >= 0; --i) {
      if (i == n - 1) {
        for (int j = 1; j <= d[i]; ++j) {
          ret = add(ret, solve0(i - 1, j < d[i], false));
        }
      } else {
        for (int j = 1; j < 10; ++j) {
          ret = add(ret, solve0(i - 1, true, false));
        }
      }
    }
    return ret;
  }

  for (int i = n - 1; i >= 0; --i) {
    if (i == n - 1) {
      for (int j = 1; j <= d[i]; ++j) {
        int cur2 = c2, cur3 = c3, cur5 = c5, cur7 = c7;
        subD(j, cur2, cur3, cur5, cur7);
        ret = add(ret, go(i - 1, j < d[i], cur2, cur3, cur5, cur7));
      }
    } else {
      for (int j = 1; j < 10; ++j) {
        int cur2 = c2, cur3 = c3, cur5 = c5, cur7 = c7;
        subD(j, cur2, cur3, cur5, cur7);
        ret = add(ret, go(i - 1, true, cur2, cur3, cur5, cur7));
      }
    }
  }
  return ret;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int64_t k;
  string l, r;
  cin >> k >> l >> r;
  cout << sub(solve(k, Parse(r)), solve(k, Parse(l) - 1)) << '\n';
  return 0;
}