#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<set>
#include<string>

using namespace std;

typedef long long LL;
int binary1[70],binary2[70];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        LL a,b;
        memset(binary1,0,sizeof(binary1));
        memset(binary2,0,sizeof(binary2));
        scanf("%lld%lld",&a,&b);
        int len1,len2;
        len1=len2=0;
        while(a>0)
        {
            binary1[len1++]=a%2;
            a=a/2;
        }
        while(b>0)
        {
            binary2[len2++]=b%2;
            b=b/2;
        }
        int maxlen=max(len1,len2);
        LL ans=0;
        for(int k=maxlen-1;k>=0;k--)
        {
            if(binary1[k]==binary2[k])
            {
                if(binary1[k]==1)
                    ans+=(LL)pow(2,k);
            }
            else
            {
                ans+=(LL)pow(2,k+1)-1;
                break;
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}