Family reunion

#include<bits/stdc++.h>

using namespace std;

int n, m, k, a[20], mark[20];

int main(){
	cin >> n >> m >> k;
	if (n == 16){
		for (int i = 0; i < k+k+1; i++)	cin >> a[i], mark[a[i]] = 1;
		for (int i = 1; i <= n; i++)
			if (!mark[i])	a[n - 1] = i;
	
		int q = a[k];
		for (int i = 0; i < n; i++)
			if (a[i] == 1){
				rotate(a, a + i, a+n);
				break;
			}
		for (int i = 0; i < n; i++)
			if (a[i] == q){
				if (i & 1)
					cout << "A\n";
				else
					cout << "B\n";
				break;
			}
	}
	return 0;
}

Test 1

Group: 1

Verdict: UNKNOWN

Test 2

Group: 2

Verdict: UNKNOWN

Test 3

Group: 3

Verdict: UNKNOWN