/*#include <iostream>
#include <fstream>

using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
const int maxn=250001;
int G[maxn];
int N,M;
bool inceput[maxn];
void parcurgere(int nod1)
{
    int nod;

}
int main()
{
    int i,x;
    f>>N>>M;
    for (i=1;i<=N;i++)
    {
        f>>x;
        G[i].push_back(x);
        inceput[x]=1;
    }
    for (i=1;i<=N;i++)
        cout<<inceput[i]<<" ";
    for (i=1;i<=N;i++)
        if (inceput[i]==0)
            parcurgere(i);

}
*/