Problem:
 Score : 300 points    Problem Statement Given are an integer X and an integer sequence of length N : p_1, \ldots, p_N .  Among the integers not contained in the sequence p_1, \ldots, p_N (not necessarily positive), find the integer nearest to X , that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.      Constraints  1 \leq X \leq 100  0 \leq N \leq 100  1 \leq p_i \leq 100  p_1, \ldots, p_N are all distinct.  All values in input are integers.         Input Input is given from Standard Input in the following format:  X  N  p_1  ...  p_N       Output Print the answer.        Sample Input 1 6 5
4 7 10 6 5      Sample Output 1 8  Among the integers not contained in the sequence 4, 7, 10, 6, 5 , the one nearest to 6 is 8 .       Sample Input 2 10 5
4 7 10 6 5      Sample Output 2 9  Among the integers not contained in the sequence 4, 7, 10, 6, 5 , the ones nearest to 10 are 9 and 11 . We should print the smaller one, 9 .       Sample Input 3 100 0      Sample Output 3 100  When N = 0 , the second line in the input will be empty. Also, as seen here, X itself can be the answer.

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    
    
    X, N = [int(x) for x in sys.stdin.readline().split()]  
    if N == 0:
        print(X)
        return
    if N >= 1:
        p_list = [int(x) for x in sys.stdin.readline().split()]  

    
    
    
    

    logger.debug('{}'.format([p_list]))

    p_set = set(p_list)
    for i in range(100):
        for s in (-1, 1):
            r = X + i * s
            if r not in p_set:
                print(r)
                return


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """6 5
4 7 10 6 5"""
        output = """8"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """10 5
4 7 10 6 5"""
        output = """9"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """100 0"""
        output = """100"""
        self.assertIO(input, output)

Solution (Python):
X, N = map(int, input().split())
P = set(list(map(int, input().split())))

i = X
j = X
while True:
    if i not in P:
        print(i)
        break
    if j not in P:
        print(j)
        break
    i -= 1
    j += 1

Solution (Python):
x,n=map(int,input().split())
if n==0:
  print(x)
  exit()
p=list(map(int,input().split()))
for i in range(102):
  if not x-i in p:
    print(x-i)
    exit()
  if not x+i in p:
    print(x+i)
    exit()

Solution (Python):

x,n=map(int,input().split())
if n==0:
    print(x)
else:
    p=list(map(int,input().split()))

    for xi in range(x,102):
        if not xi in p:
            break
        
    for xi2 in range(x,-1,-1):
        if not xi2 in p:
            break

    if xi-x<x-xi2:
        print(xi)
    else:
        print(xi2)

Solution (Python):
x,n=input().split()
x=int(x)
n=int(n)
p=list(map(int,input().split()))
if(n==0):
    print(x)
    exit()
i=0
while(True):
    x_r=x+i
    x_l=x-i

    if(x_l not in p):
        a=x_l
        break
    if(x_r not in p):
        a=x_r
        break

    i+=1


print(a)

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    X, N = R()
    if N == 0:
        print(X)
        return
    P = R()
    l = [0] * 102
    for p in P:
        l[p] = 1
    
    tmp = INF
    tmp2 = -1
    for i in range(102):
        if l[i] == 1:
            continue
        if abs(X-i) < tmp:
            tmp = abs(X-i)
            tmp2 = i
    print(tmp2)
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
x, n = map(int, input().split())
p = [int(y) for y in input().split()]

for i in range(200):
    if x-i not in p:
        print(x-i)
        break
    if x+i not in p:
        print(x+i)
        break

Solution (Python):

x, n = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
if x in arr:
    ans = 10**9
    diff = 10**9
    for i in range(0, 102):
        if i not in arr:
            if(abs(x - i) < diff):
                diff = abs(x-i)
                ans = i
    print(ans)
else :
    print(x)

Solution (Python):
X, N = (int(i) for i in input().split())
p = [int(i) for i in input().split()]

res = -1
min = 300
for x in reversed(range(X - 110, X + 110)):
    if x not in p:
        if min >= abs(X - x):
            min = abs(X - x)
            res = x

print(res)

Solution (Python):
X, N = map(int, input().split())
*P, = map(int, input().split())
cand = set(range(-50, 151)) - set(P)
cand = sorted([c for c in cand], key=lambda x: (abs(X - x), x))
print(cand[0])

Solution (Python):
X, N = [int(_) for _ in input().split()]
P = [int(_) for _ in input().split()]

d = 1000
ans = None
for i in range(-101, 201):
    if i in P:
        continue
    if abs(X-i) < d:
        d = abs(X-i) 
        ans = i
print(ans)

Solution (Python):
X, N = map(int, input().split())

if N != 0:
    p = list(map(int, input().split()))
else:
    p = []

for i in range(100):
    if (X - i) not in p:
        print(X - i)
        break

    elif (X + i) not in p:
        print(X + i)
        break

Solution (Python):
import numpy as np

X, N = map(int, input().split())
P = np.array(list(map(int, input().split())))

P = P - X

for i in range(0, X + 1):
    if i not in P or -i not in P:
        if -i not in P:
            ans = X - i
        else:
            ans = X + i
        break

print(ans)

Solution (Python):
import numpy as np

X, N = map(int, input().split())
P = list(map(int, input().split()))

not_inc = []

for i in range(-200, 200):
  if i not in P:
    not_inc.append(i)

not_inc_gap = [abs(not_inc[i] - X) for i in range(len(not_inc))]

index = np.argmin(not_inc_gap)

if N == 0:
  print(X)
else:
  print(not_inc[index])

Solution (Python):
x, n = map(int, input().split())
if n != 0:
    p = [int(x) for x in input().split()]
else:
    print(x)
    exit()
    
if x not in p:
    print(x)
    exit()
    
xl = x-1
xr = x+1
while 1:
    if xl not in p:
        print(xl)
        exit()
    if xr not in p:
        print(xr)
        exit()
    xl -= 1
    xr += 1

Solution (Python):
import sys
def input():
    return sys.stdin.readline().rstrip('\n')

def calc(X, N, p):
    k = 0
    while True:
        if not X - k in p:
            return X - k
        elif not X + k in p:
            return X + k
        k += 1
    

(X, N) = tuple([int(s) for s in input().split()])
p = [int(s) for s in input().split()]
print(calc(X, N, p))

Solution (Python):
X, N = list(map(int, input().split()))
p = list(map(int, input().split()))
st = set(p)
diff = 0
while True:
    if X - diff not in st:
        print(X - diff)
        break
    if X + diff not in st:
        print(X + diff)
        break
    diff += 1

Solution (Python):
x,y=map(int, input().split())
if y!=0:
    l=list(map(int, input().split()))
else:
    l=[]
num=x
num1=x
val=0
val1=0
while True:
    if num not in l:
        val=1
        break
    if num1 not in l:
        val1=1
        break
    num=num-1
    num1=num1+1
if val==1:
    if num1 not in l:
        val1=1
if val==0 and val1==1:
    print(num1)
elif val==1 and val1==0:
    print(num)
else:
    print(min(num,num1))

Solution (Python):
X,N = map(int,input().split())
if N>0:
    p_set = set(map(int,input().split()))
else:
    p_set = set()

min_dist_xp = 1000
for p in reversed(range(0,102)):
    if p not in p_set:
        dist_xp = abs(X-p)
        if dist_xp<=min_dist_xp:
            min_dist_xp = dist_xp
            ans = p

print(ans)

Solution (Python):
X, N = list(map(int, input().split()))

P = list(map(int, input().split()))
if (N == 0):
    print(X)
    exit(0)

i = 0
while (True):
    if (X - i not in P):
        print(X - i)
        break
    elif (X + i not in P):
        print(X + i)
        break
    i += 1

Solution (Python):
x, n = map(int, input().split())
if n == 0:
  print(x)
  exit()
a = list(map(int, input().split()))
b = list(range(102))
result = list(set(b) - set(a))
r = sorted(result)
min_ = 10**9
min_idx = -1
for i in range(len(r)):
  if abs(r[i]-x) < min_:
    min_ = abs(r[i]-x)
    min_idx = i
print(r[min_idx])

Solution (Python):
X, N = map(int, input().split())
x = list(map(int, input().split()))

for i in range(10000):
  if X-i not in x:
    print(X-i)
    exit(0)
  elif X+i not in x:
    print(X+i)
    exit(0)

Solution (Python):
X, N = map(int, input().split())
ans = 102

if N == 0:
  ans = X
  
else:
  p = list(map(int, input().split()))
  if X not in p:
    ans = X
  else:
    mi = X
    pl = X
    while ans == 102:
      mi -= 1
      pl += 1
      if mi not in p:
        ans = mi
      elif pl not in p:
        ans = pl
        
print(ans)

Solution (Python):
X,N=map(int,input().split())
if N != 0:
  p=list(map(int,input().split()))
else:
  p=[]
d=0
while True:
  if not (X-d in p):
    print(X-d)
    break
  elif not (X+d in p):
    print(X+d)
    break
  d+=1

Solution (Python):
x,n = map(int,input().split())
p = list(map(int,input().split()))
if(n == 0):
    print(x)
else:
    t = [0]*102
    q = -1
    for i in range(n):
        t[p[i]] += 1
    if(t[x] == 0):
        q = x
    i = 1
    while(q == -1):
        if(t[x-i] == 0):
            q = x-i
        elif(t[x+i] == 0):
            q = x+i
        i += 1
    print(q)

Solution (Python):

from sys import stdin
input = stdin.readline
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

x,n = inm()
if n==0:
    print(x)
    exit()
p = inl()
mn = 999
for i in range(102):
    if i in p:
        continue
    d = abs(i-x)
    if d<mn:
        mn = d
        mni = i
print(mni)

Solution (Python):
X, N = map(int, input().split())
*p, = map(int, input().split())
s = set()
for i in range(-150, 150):
    if i in p:continue
    s.add(i)
l = sorted(s)

b = 10**20
ans = 0

for i in l:
    if b>abs(i-X):
        b = abs(i-X)
        ans = i

print(ans)

Solution (Python):
x,n = map(int,input().split())
if n == 0:
    print(x)
    exit()
p = list(map(int,input().split()))
pp = list(range(102))

for i in p:
    pp.remove(i)

ans = 0
sa = 100000

for i in pp:
    memo = abs(x - i)
    if memo < sa:
        sa = memo
        ans = i

print(ans)

Solution (Python):
x, n = map(int, input().split())

p = list(map(int, input().split()))

c = float('inf')
ans = 0
for i in range(-10, 110):
    if i not in p:
        if c > abs(x - i):
            c = abs(x - i)
            ans = i

print(ans)

Solution (Python):
def c_forbidden_list():
    X, N = [int(i) for i in input().split()]
    P = set([int(i) for i in input().split()]) if N != 0 else []

    if not P:
        return X

    minimum = float('inf')
    ans = -float('inf')
    for t in range(102):
        if (not t in P) and (abs(X - t) < minimum):
            minimum = abs(X - t)
            ans = t
    return ans

print(c_forbidden_list())

Solution (Python):
import sys
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

x,N = IL()
a = IL()
a.sort()

ans = [MAX_INT, 0]

for i in range(-200, 200):
  if i not in a:
    if ans[0] > abs(i - x):
      ans = [abs(i - x), i]

print(ans[1])

Solution (Python):
from typing import Dict, List, Optional, Tuple, Union  


def main(X: int, N: int, p: List[int]):
    ans = 0

    if not p:
        ans = X
    else:
        p.sort()
        candidates: List[int] = [x for x in range(min(p) - 1, max(p) + 2) if x not in p]

        diff = 10**9
        for i in candidates:
            if abs(i - X) < diff:
                ans = i
                diff = abs(i - X)
    print(ans)



if __name__ == "__main__":
    X, N = map(int, input().split())
    p = list(map(int, input().split()))
    main(X, N, p)

Solution (Python):
X,N = map(int,input().split())

P = list(map(int,input().split()))

for i in range(N+1):
    if not X-i in P:
        print(X-i)
        exit()
    if not X+i in P:
        print(X+i)
        exit()

Solution (Python):
x, n = map(int, input().split())
p = list(map(int, input().split()))
MIN = float('inf')
ans = 0

if x not in p:
    print(x)
else:
    i = 1
    while True:
        if x-i not in p:
            print(x-i)
            break
        elif x+i not in p:
            print(x+i)
            break
        else:
            i += 1

Solution (Python):
x, n = map(int, input().split())
p = list(map(int, input().split()))
if not p:
    print(x)
    exit()
left_x = right_x = x
if x not in p:
    print(x)
    exit()
while 1:
    left_x = left_x - 1
    right_x = right_x + 1
    if left_x not in p:
        print(left_x)
        exit()
    elif right_x not in p:
        print(right_x)
        exit()

Solution (Python):
x, n = map(int, input().split())
list_P = list(map(int, input().split()))
list_P = set(list_P)
ans = pow(10, 10)

for i in range(-110, 111):
    if abs(i-x) < abs(x-ans):
        if i not in list_P:
            ans = i

print(ans)

Solution (Python):
from collections import defaultdict as dd
x,n=map(int, input().split())
ar=list(map(int,input().split()))
d=dd(int)
for i in ar:
    d[i]=1
low,high=0,0
for i in range(x,-2,-1):
    if d[i]==0:
        low=i
        break
for i in range(x,102):
    if d[i]==0:
        high=i
        break    
if high-x<x-low: print(high)
else: print(low)

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    x, n = list(map(int,sys.stdin.readline().split()))
    p = list(map(int,sys.stdin.readline().split()))
    if not x in p:
        print(x)
        return 0
    t = 1 
    while(True):
        search_num = x - t
        if not search_num in p:
            print(search_num)
            break
        search_num = x + t
        if not search_num in p:
            print(search_num)
            break
        t += 1


    return 0

if __name__ == "__main__":
    main()

Solution (Python):
import sys

(x, n) = list(map(int, input().split()))
arr = list(map(int, input().split()))

if(len(arr) == 0):
    print(x)
    sys.exit()

if(not(x in arr)):
    print(x)
    sys.exit()

i = 1
while True:
    if(not (x - i in arr)):
        print(x - i)
        sys.exit()
    
    if(not (x + i in arr)):
        print(x + i)
        sys.exit()
    i += 1

Solution (Python):
x,n=map(int, input().split())
p=list(map(int, input().split()))
koho=[]
abmi=1000
for a in range(101):
    koho.append(x-50+a)
for a in p:
    if a in koho:
        koho.remove(a)
for a in koho:
    ab=abs(a-x)
    if ab<abmi:
        abmi=ab
        ans=a
print(ans)

Solution (Python):
x,n = map(int,input().split())
p = list(map(int,input().split()))

l = x
while True:
    if l in p:
        l += 1
    else:
        break

r = x
while True:
    if r in p:
        r -= 1
    else:
        break

if abs(x-l) < abs(x-r):
    print(l)
else:
    print(r)

Solution (Python):
x,n = map(int,input().split())
if n == 0:
    print(x)
    exit()
p = list(map(int,input().split()))
flag = True
i = 0
while flag:
    if x - i not in p:
        print(x-i)
        flag = False
        break
    elif x + i not in p:
        print(x+i)
        flag = False
        break
    i += 1

Solution (Python):
[X,N]=list(map(int, input().split()))
plist=list(map(int, input().split()))
for i in range(100):
    if X-i not in plist:
        print(X-i)
        break
    elif X+i not in plist:
        print(X+i)
        break
    else:
        continue

Solution (Python):
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

x, n = na()
p = na()

res = 0
for i in range(102):
    if abs(i-x)<abs(res-x):
        if not i in p:
            res = i


print(res)

Solution (Python):
x,n = map(int, input().split())
p = list(map(int, input().split()))

m = x
ans = 0

for i in range(1, 102):
    if not (i in p):
        if abs(x - i) < m:
            m = abs(x - i)
            ans = i

print(ans)