For this Question: Given an unsorted array A of size N and value K. The elements of the array A contains positive integers. You have to print all the elements which are greater than K in the array in sorted order (including K as well if present in the array A), and print all the elements which are smaller than K in sorted order both of them in separate lines. If the elements greater than or equal to K are not present in the array then print "-1". Similarly, in the case of smaller elements print -1 if elements smaller than K doesn’t exist. If a number appears more than once print number more than once.First line of input contains number of testcases T. For each testcase, there are two lines, first of which contains N and K separated by space, next line contains N space separated integers.


Constraints:
1 <= T <= 100
1 <= N <= 100000
1 <= K <= 1000000
1 <= A[i] <= 1000000
Sum of N over all test cases do not exceed 100000For each testcase, print the required elements(if any), else print "-1" (without quotes)Input:
1
5 1
2 1 5 7 6

Output:
1 2 5 6 7
-1

Explanation:
Testcase 1 : Since, 1, 2, 5, 6, 7 are greater or equal to given K. Also, no element less than K is present in the array., I have written this Solution Code: t=int(input())
while t>0:
    a=input().split()
    b=input().split()
    for i in range(len(b)):
        b[i]=int(b[i])
    lesser=[]
    greater=[]
    for i in b:
        if i>=int(a[1]):
            greater.append(i)
        else:
            lesser.append(i)

    if len(greater)==0:
        print(-1,end="")
    else:
        greater.sort()
        for x in greater:
            print(x,end=" ")
    print()
    if len(lesser)==0:
        print(-1,end="")
    else:
        lesser.sort()
        for y in lesser:
            print(y,end=" ")
    print()
    t-=1, In this Programming Language: Python, Now tell me if this Code is compilable or not?