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.

bhatabhi554 | 317 |

hardikJain5 | 306 |

CodeBuddy | 293 |

Akkki111 | 233 |

clone | 230 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

mazumderrohit8 | 1176 |

RemoveTLE | 1144 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4605 |

Quandray | 4444 |

Login to report an issue on this page.