For this Question: You are given an array <b>A</b> of size <b>N</b>. You need to find the integer not present in this array that is closest to <b>K</b>. The closeness between two numbers A[i] and A[j] is defined as <b>abs(A[i] - A[j])</b>. 

For Example:
For given array A = [1,2,5,6,13]
For given K = 12
Output: 12

Explanation: numbers missing 3, 4, 7,8, 9, 10, 11, 12, 14, 15....
and K = 12, so distance from each missing number is (3,9), (4,8), ....
where every pair denotes (missing number, distance) hence 12 is answer.The first line of the input contains two integers N and K.

Constraints
1 <= N <= 1000
1 <= A[i] <= 10000
1 <= K <= 10000

(The array may not contain all distinct numbers)Output the required closest number.Sample Input
5 6
4 7 10 6 5

Sample Output
8

Explanation: Closeness of 8 is 2. There is no such number that has closeness lesser than this and is not a part of array.

Sample Input
5 10
4 7 10 6 5

Sample Output
9, I have written this Solution Code: size,k = map(int,input().split())
lis = list(map(int,input().split()))
l=[]
m=0
for i in lis:
    if(k+m in lis and k-m in lis):
        m=m+1
    else:
        if(k-m in lis):
            print(k+m)
        else:
            print(k-m)
        break, In this Programming Language: Python, Now tell me if this Code is compilable or not?