#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX=50000;
vector <int>v[NMAX+5];
int st[NMAX+5];
int k=0;
bool viz[NMAX+5];
void dfs(int u)
{
    int i;
    viz[u]=1;
    for(i=0;i<v[u].size();i++)
    {
        if(viz[v[u][i]]==0)
            dfs(v[u][i]);
    }
    st[++k]=u;
}
int main()
{
    int i, n, m, x, y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
      dfs(1);
      for(i=k;i>=1;i--)
        fout<<st[i]<<"\n";
    return 0;
}