You are given a range of positive integers from $l$ to $r$.

Find such a pair of integers $(x, y)$ that $l \le x, y \le r$, $x \ne y$ and $x$ divides $y$.

If there are multiple answers, print any of them.

You are also asked to answer $T$ independent queries.


-----Input-----

The first line contains a single integer $T$ ($1 \le T \le 1000$) — the number of queries.

Each of the next $T$ lines contains two integers $l$ and $r$ ($1 \le l \le r \le 998244353$) — inclusive borders of the range.

It is guaranteed that testset only includes queries, which have at least one suitable pair.


-----Output-----

Print $T$ lines, each line should contain the answer — two integers $x$ and $y$ such that $l \le x, y \le r$, $x \ne y$ and $x$ divides $y$. The answer in the $i$-th line should correspond to the $i$-th query from the input.

If there are multiple answers, print any of them.


-----Example-----
Input
3
1 10
3 14
1 10

Output
1 7
3 9
5 10

Difficulty: interview

Starter code:

Solutions:
t = int(input())
for i in range(t):
	l, r = list(map(int, input().split()))
	print(l, 2 * l)


n=int(input())
for x in range(n):
    a,b=map(int,input().split())
    print(a,2*a)

T = int(input())
for i in range(T):
    l, r = map(int, input().split())
    print(l, l * 2)

n = int(input())
for t in range(n):
    z1, z2 = map(int, input().split())
    print(z1, 2*z1)

t = int(input())
for i in range(t):
    l, r = list(map(int,input().split()))
    if 2 * l <= r:
        print(l, 2 * l)


t = int(input())
for i in range(t):
	x, y = list(map(int, input().split()))
	print(x, x * 2)


for i in range(int(input())):
    l, r = map(int, input().split())
    print(l, l * 2)

n = int(input())
for i in range(n):
    l, r = list(map(int, input().split()))
    print(l, l * 2)


t = int(input())
for i in range(t):
    l,r = list(map(int,input().split()))
    print(l,l*2)


t = int(input())
for i in range(t):
    l, r = map(int, input().split())
    print(l, 2 * l)

for i in range(0,int(input())):
    x,y=map(int,input().split())
    print(x,2*x)

t = int(input())
for i in range(t):
	x, y = list(map(int, input().split()))
	print(x, x * 2)


T = int(input())
for i in range(T):
    l,r = list(map(int,input().split()))
    print(l,l+l)


x=int(input())
for i in range(x):
    a,b=map(int,input().split())
    print(a,a*2)

#      
import collections, atexit, math, sys, bisect 

sys.setrecursionlimit(1000000)
def getIntList():
    return list(map(int, input().split()))    

try :
    #raise ModuleNotFoundError
    import numpy
    def dprint(*args, **kwargs):
        #print(*args, **kwargs, file=sys.stderr)
        # in python 3.4 **kwargs is invalid???
        print(*args,  file=sys.stderr)
    dprint('debug mode')
except Exception:
    def dprint(*args, **kwargs):
        pass



inId = 0
outId = 0
if inId>0:
    dprint('use input', inId)
    sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件
if outId>0:
    dprint('use output', outId)
    sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件
    atexit.register(lambda :sys.stdout.close())     #idle 中不会执行 atexit
    
T, = getIntList()
#print(N)
for _ in range(T):
    a,b = getIntList()
    print(a,a*2)







n = int(input())
for i in range(n):
    l, r = list(map(int, input().split()))
    print(l, l * 2)

MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

t, = I()
while t:
    t -= 1
    n, k = I()
    print(n, 2*n)

import sys
input = sys.stdin.readline


t=int(input())
for i in range(t):
    l,r=list(map(int,input().split()))

    print(l,2*l)


import math, sys
from fractions import *

def mp():
    return list(map(int, input().split()))

def main():
    t = int(input())
    for i in range(t):
        l, r = mp()
        print(l, l * 2)
deb = 0
if deb:
    file = open('input.txt', 'w')
else:
    input = sys.stdin.readline
    
main()

t = int(input())
for i in range(t):
    l, r = map(int, input().split())
    print(l, 2*l)

def ii():
    return int(input())
def mi():
    return list(map(int, input().split()))
def li():
    return list(mi())

for t in range(ii()):
    l, r = mi()
    print(l, 2 * l)


#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=int(input())
for tt in range(t):
    #n=int(input())
    l,r= map(int, sys.stdin.readline().split(' '))
    v=2*l
    print(l,v)
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

t = int(input())
for i in range(t):
    l , r = [int(c) for c in input().split()]
    print(l, 2 * l)


# alpha = "abcdefghijklmnopqrstuvwxyz"
t = int(input())
from heapq import heappop, heappush
for test in range(t):
    # n = int(input())
    n,m = (list(map(int, input().split())))
    print(n, 2*n)