#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m,s,x,y;
vector  <int> gr[50010];
queue <int > q;
int viz[50005];

void bfs(int j)
{
    viz[j]=1;
    for (auto i:gr[j])
        {   if(viz[i]==0)
                {   g<<i<<" ";
                    bfs(i);

                }
        }
}

void citire()
{
    f>>n>>m;
    for (int i=1; i<=m; i++)
    {
        f >> x>> y;
        gr[x].push_back(y);

    }
}

int main()
{
    citire();
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {   g<<i<<" ";
            bfs(i);

        }
    }
    return 0;
}