public static void DFS(int node){
		if(vis[node]){
			cycle = true;
			return;
		}
		if(cycle)
			return;
		vis[node] = true;
		for (int i = 0; i < m[node].size(); i++) {
			DFS(m[node].get(i));
		}
	}