void TopSort()

{
    for (int i = 1; i <= node; i++)

    {
        DFS(i);
    }
    if (hasCycle)
    {
        cout<<"IMPOSSIBLE"<<endl;
        return ;
    }

    while(!s.empty())
    {
        cout<<s.top()<<endl;
        s.pop();
    }

}