Question: 
Write a python function to find two distinct numbers such that their lcm lies within the given range.


Model's Code:
def lcm(a, b):
    from math import gcd
    return abs(a * b) // gcd(a, b)

def answer(min_lcm, max_lcm):
    for i in range(1, max_lcm + 1):
        for j in range(i + 1, max_lcm + 1):
            current_lcm = lcm(i, j)
            if min_lcm <= current_lcm <= max_lcm:
                return (i, j)
    return None



Sample Correct Code:
def answer(L,R): 
    if (2 * L <= R): 
        return (L ,2*L)
    else: 
        return (-1) 


Asserts:
assert answer(3,8) == (3,6)
assert answer(2,6) == (2,4)
assert answer(1,3) == (1,2)


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 177 of 974: 131/177 (74.01129943502825%): failed