#include <fstream>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

struct nod
{
    int info;
    nod *leg;
};

nod *L[200003], *p, *q;
bool viz[200003];
int n, m, i, j, x, y;
int cc;

void adaug(nod *&prim, int val)
{
    p = new nod;
    p->info = val;
    p->leg = prim;
    prim = p;
}

void travad(int val)
{
    fout << val << ' ';
    viz[val] = 1;
    nod *p = L[val];
    while(p != NULL)
    {
        if(viz[p->info] == 0)
        {
            travad(p->info);
        }
        p=p->leg;
    }
}

int main()
{
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        L[i] = NULL;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        adaug(L[x], y);
        //adaug(L[y], x);
    }
     for(i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            travad(i);
            fout << '\n';
        }
    }
}