#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint A, B;
  cin >> A >> B;
  lint N = B - A + 1;
  vector<lint> X(N);
  vector<lint> prime = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
  vector<vector<bool>> isprime(N, vector<bool>(20));
  REP(i, N) REP(j, 20) if((A+i)%prime[j] == 0) X[i] += (1<<j);
  vector<vector<lint>> dp(N+1, vector<lint>(1<<20));
  dp[0][0] = 1;
  REP(i, N) REP(bit, 1<<20) {
    dp[i+1][bit] += dp[i][bit];
    if((bit&X[i]) == X[i]) {
      dp[i+1][bit] += dp[i][bit^X[i]];
    }
  }
  lint ans = 0;
  REP(bit, 1<<20) {
    ans += dp[N][bit];
    //if(dp[N][bit] > 0) cout << bit << " " << dp[N][bit] << endl;
  }
  cout << ans << endl;
}
/*
    /\ In The Name Of Allah /\
    Author : Jawahiir Nabhan
*/
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const char nl = '\n';

int main()
{
    ll N,K; cin>> N >> K;
    for(int i = 0;i < K;i++){
        if(N % 200 == 0) N /= 200;
        else N = N*1000 + 200;
    }
    cout<< N << nl;
}

