#include "stub.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>G[60];
int vis[60];
set<pair<int, int>>ans;
map<int, int>mpp;
void dfs(int node, int sz, int parent)
{
	vis[node] = true;
	for (auto i : G[node])
	{
		if (vis[i])continue;
		dfs(i, sz + 1, parent);
	}
	mpp[parent] = max(mpp[parent], sz);
}

void swapCards(int cards[], int S, int T) {
	int n = 52;
	for (int i = 0; i < n; i++)
	{
		G[i].push_back(cards[i]);
		G[cards[i]].push_back(i);
	}

	int mx = 0;
	for (int i = 0; i < n; i++)
	{
		if (!vis[i])
		{
			dfs(i, 1, i);
		}
	}
	for (auto i : mpp)
	{
		ans.insert({ i.second, i.first });
	}

	for (int i = 0; i < 60; i++)vis[i] = false;
	for (auto i : ans)
	{
		int node1 = i.second;
		int node = i.second;
		int h = i.first;
		for (int i = 0; i < 60; i++)vis[i] = false;
		while(h > T){
			int x = T;
			h -= T;
			S--;

			while (x--)
			{
				vis[node] = true;
				for (auto i : G[node])
				{
					if (!vis[i])
					{
						node = i;
					}
				}
			}
			doSwap(node1, node);
			node1 = node;
			
			//break;
		}
	}
	for (int i = 0; i < 52; i++)
	{
		G[i].clear(); vis[i] = false;
	}
	mpp.clear(); ans.clear();
}




void guessCard(int S, int T, int target){
	vector<int>used(100);
	int node = target;
	int val = -1;
	while (val != target)
	{
		used[node] = true;
		val = guess(node);
		if (val == target)
		{
			return;
		}
		node = val;
	}
}