#include<iostream>    
using namespace std;
int m,n,cnt=0;
void DFS(int root){
    if(root>n) return;
    cnt++;
    DFS(root*2);
    DFS(root*2+1);
}
int main(){
    while(cin >> m >> n){
        if(m==0 && n==0) break;
        cnt=0;
        DFS(m);
        cout << cnt << endl;
    }
    return 0;
}