#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Pii = pair<int, int>;
int uplg(int n) { return 32 - __builtin_clz(n); }
int uplg(ll n) { return 64 - __builtin_clzll(n); }
void run();
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(18);
  run();
  return 0;
}
constexpr int MAX_TAIL = 18;
ll L, R, ans;
Vi tail, digL, digR;
ll greatest(int len) {
  len = max(len, int((tail).size()));
  ll ret = 0;
  for (int i = int((tail).size()) - 1; i >= 0; i--) {
    ret = ret * 10 + tail[i];
  }
  for (int i = (0); i < (len - int((tail).size())); i++) ret *= 10;
  return ret;
}
ll smallest(int len) {
  len = max(len, int((tail).size()));
  ll ret = tail[0];
  for (int i = (0); i < (len - int((tail).size())); i++) ret *= 10;
  for (int i = (1); i < (int((tail).size())); i++) ret = ret * 10 + tail[i];
  return ret;
}
bool check() {
  if (int((digL).size()) == int((digR).size())) {
    if (int((tail).size()) > int((digL).size())) {
      return 0;
    }
    {
      int cnt[10] = {0};
      for (auto& c : (tail)) cnt[c]++;
      cnt[0] = int((digL).size()) - int((tail).size());
      bool eq = 1, ok = 1;
      for (int i = (0); i < (int((digL).size())); i++) {
        int dl = digL[i], dr = digR[i];
        if (eq) {
          if (dl == dr) {
            if (cnt[dl] == 0) {
              ok = 0;
              break;
            }
            cnt[dl]--;
          } else {
            for (int c = (dl + 1); c < (dr); c++) {
              if (cnt[c] > 0) {
                return 1;
              }
            }
            if (cnt[dl] == 0) {
              ok = 0;
              break;
            }
            cnt[dl]--;
            eq = 0;
          }
        } else {
          for (int c = (dl + 1); c < (10); c++) {
            if (cnt[c] > 0) {
              return 1;
            }
          }
          if (cnt[dl] == 0) {
            ok = 0;
            break;
          }
          cnt[dl]--;
        }
      }
      if (ok) {
        return 1;
      }
    }
    {
      int cnt[10] = {0};
      for (auto& c : (tail)) cnt[c]++;
      cnt[0] = int((digL).size()) - int((tail).size());
      bool eq = 1, ok = 1;
      for (int i = (0); i < (int((digL).size())); i++) {
        int dl = digL[i], dr = digR[i];
        if (eq) {
          if (dl == dr) {
            if (cnt[dl] == 0) {
              ok = 0;
              break;
            }
            cnt[dl]--;
          } else {
            for (int c = (dl + 1); c < (dr); c++) {
              if (cnt[c] > 0) {
                return 1;
              }
            }
            if (cnt[dr] == 0) {
              ok = 0;
              break;
            }
            cnt[dr]--;
            eq = 0;
          }
        } else {
          for (int c = (0); c < (dr); c++) {
            if (cnt[c] > 0) {
              return 1;
            }
          }
          if (cnt[dr] == 0) {
            ok = 0;
            break;
          }
          cnt[dr]--;
        }
      }
      if (ok) {
        return 1;
      }
    }
  } else {
    ll gr = greatest(int((digL).size()));
    if (gr >= L && gr <= R) {
      return 1;
    }
    ll sm = smallest(int((digL).size()) + 1);
    if (sm >= L && sm <= R) {
      return 1;
    }
  }
  return 0;
}
void gen(int d) {
  if (d == 10) {
    if (!tail.empty()) {
      ans += check();
    }
    return;
  }
  gen(d + 1);
  if (int((tail).size()) < MAX_TAIL) {
    tail.push_back(d);
    gen(d);
    tail.pop_back();
  }
}
void run() {
  cin >> L >> R;
  for (ll k = L; k > 0; k /= 10) digL.push_back(int(k % 10));
  for (ll k = R; k > 0; k /= 10) digR.push_back(int(k % 10));
  reverse((digL).begin(), (digL).end());
  reverse((digR).begin(), (digR).end());
  assert(int((digL).size()) <= int((digR).size()));
  gen(1);
  cout << ans << '\n';
}
