#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
bool viz[50003];
int k=0,d[50003];
vector <int> adiacenta[50003];
void DFS(int x)
{
    viz[x]=1;
    d[++k]=x;
    for(auto i: adiacenta[x])
    {
        if(viz[i]==0)
            DFS(i);
    }
}
int main()
{
    int n,m,x,y,i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        adiacenta[x].push_back(y);
    }
    DFS(1);
    for(i=1;i<=n;i++)
        if(!viz[i])
          DFS(i);
    for(i=1;i<=n;i++)
        fout<<d[i]<<" ";

    return 0;
}