Competitive_Programming/codeforces/1330/A.cpp at master · nishitsharma03/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;

int main()
{ quick;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
	int t;
	cin>>t;
	while(t--)
	{
		ll int n,x;
		cin>>n>>x;
		ll int a[n];
		fab(0,n,i)
		cin>>a[i];
		int ch[500]={0};
		fab(0,n,i)
		{
			ch[a[i]]=1;
		}
		int i=1;
		ll int cnt=0;
		while(cnt!=x)
		{
			if(ch[i]==0)
				{cnt++;
					ch[i]=1;
					//cout<<ch[i]<<" g";
				}

			i++;
		}
		int ans=0;
		fab(1,500,i)
		{

			if(ch[i]==1)
				{
					ans=i;
				}
				else
					break;

		}
		cout<<ans<<endl;
	}


	return 0;
}