/**************************************************************

     Problem: 1026

     User: mjy0724

     Language: Pascal

     Result: Accepted

     Time:0 ms

     Memory:228 kb

 ****************************************************************/

 program bzoj1026;

 var i,l,r:longint;

     w,num:array[-..]of longint;

     f:array[-..,..]of longint;

 function solve(p:longint):longint;

 var i,j,k,ans:longint;

     flag:boolean;

 begin

         if p= then exit();

     fillchar(f,sizeof(f),);

     for i:= downto  do if p div w[i]> then break;

         if p div w[i]> then inc(i);

     for j:=i downto  do num[j]:=p div w[j-] mod ;

         for j:= to num[i]- do f[i,j]:=;

     flag:=true;

     for i:=i- downto  do

     begin

         for j:= to  do

             for k:= to  do if abs(j-k)>= then inc(f[i,j],f[i+,k]);

         for j:= to  do inc(f[i,j]);

         if flag then for j:= to num[i]- do if abs(j-num[i+])>= then inc(f[i,j]);

         if abs(num[i]-num[i+])< then flag:=false;

     end;

     ans:=;

     for i:= to  do inc(ans,f[,i]);

         if flag then inc(ans);

     exit(ans);

 end;

 begin

     w[]:=;

     for i:= to  do w[i]:=w[i-]*;

         readln(l,r);

     writeln(solve(r)-solve(l-));

 end.