int ret = n % m;

if (ret < 0) ret += m;

return ret;

if (a == 0)

return b;

else

return gcd(b % a, a);

int x, n;

cin >> x >> n;

int best = 1000000000;

int ans = 10000000;

set<int> s;

for (int i = 0; i < n; i++) {

int k;

cin >> k;

s.insert(k);

}

for (int i = x - 100; i <= x + 100; i++) {

if (abs(x - i) < best || (abs(x - i) == best && ans > i)) {

if (s.count(i)) continue;

ans = i;

best = abs(x - i);

}

}

cout << ans << endl;

DESYNC;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int t = 1;

#ifdef MULTIPLE_TEST_CASE

cin >> t;

#endif

while (t--) solution();