Akku likes binary numbers and she likes playing with these numbers. Her teacher once gave her a question.For given value of L and R, Akku have to find the count of number X, which have only three-set bits in it's binary representation such that "L <= X <= R".Akku is genius, she solved the problem easily. Can you do it ??

**Input:**

The first line of input contains of an integer T i.e number of test cases. Next T lines contains two space seperated integers L,R

**Output:**

Output consists of T lines each indicating the answer for each test case.

**Constraints:**

1 <= T <= 10000

1 <= L <= R <= 10^18

**Example:**

Sample Input :

1

11 19

Sample Output :

4

**Explanation :**

There are 4 such numbers with 3 set bits in range 11 to 19.

11 -> 1011

13 -> 1101

14 -> 1110

19 -> 10011

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

I_give_up | 241 |

maggiiiii | 143 |

makeitdonesolo | 140 |

lost_found | 128 |

abhithakur588 | 119 |

Bishnu Dev Panda | 777 |

I_give_up | 552 |

okayboss | 551 |

yk12 | 514 |

makeitdonesolo | 480 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.