跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1856. Bits

  • ID: 1862
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 位运算
  • 构造
  • 数学
  • 算法思想
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Bits

题目描述

A. Bits
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Let's denote as the number of bits set ('1' bits) in the binary representation of the non-negative integer x.

You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l≤x≤r, and is maximum possible. If there are multiple such numbers find the smallest of them.

Input

The first line contains integer n− the number of queries (1≤n≤10000).

Each of the following n lines contain two integers li,ri− the arguments for the corresponding query (0≤li≤ri≤1018).

Output

For each query print the answer in a separate line.

Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note

The binary representations of numbers from 1 to 10 are listed below:

110=12

210=102

310=112

410=1002

510=1012

610=1102

710=1112

810=10002

910=10012

1010=10102


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1427 题。保留原作者与原赛事署名。