cin >> n >> t >> q;
for(i = 1; i <= q; i++)
{
	cin >> a[i];
}
for(i = 1; i <= q; i++)
{
	j = a[i];
	b = t;
	cnt = 0;
	memset(sum, 0, sizeof(sum));
	memset(ans, 0, sizeof(ans));
	num = 1;
	while(1)
	{
		ans[num] = j;
		num++;
		sum[j]++;
		if(sum[j] == 2)
		{
			break;
		}
		else
		{
			cnt++;
		}
		if(j % 2 == 0)
		{
			j = j / 2 + (n + 1) / 2;
		}
		else
		{
			j = j / 2 + 1;
		}
	}
	b = b % cnt + 1;
	cout << ans[b] << " ";
}
return 0;