#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #define ll __int64

 using namespace std;

 ll a[]={,,,,,,,,,,,,,,,

 ,,,,,,,,,

 ,,,,,,,

 ,,,};

 ll sa[],sb[],s[];

 int get(int n)

 {

     int bit=;

     while(n){

         bit++;

         n>>=;

     }

     return bit;

 }

 void solve(int n,ll *aa)

 {

     ll i,j,nn=n+;

     if(n<=) return;

     int len=get(n);

     for(int k=;k<len;k++){

         aa[k]+=nn/a[k+]*a[k];

         j=nn%a[k+];

         if(j>=a[k]) j-=a[k];

         else j=;

         aa[k]+=j;

     }

 }

 int main()

 {

     int n,m,len1,len2;

     ll c;

     while(scanf("%d%d",&n,&m)!=EOF){

         memset(sa,,sizeof(sa));

         memset(sb,,sizeof(sb));

         memset(s,,sizeof(s));

         solve(m,sa);

         solve(n-,sb);

         for(int i=;i<;i++) s[i]=sa[i]-sb[i];

         ll ans=;

         for(int i=;i<;i++){

             c=(s[i]>>);

             ans+=c;

             s[i+]+=c;

         }

         printf("%I64d\n",ans);

     }

     return ;

 }