#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax=50001;
int topsort[nmax],n,m,k;
vector<int>L[nmax];
bool viz[nmax];
void DFS(int varf)
{
    viz[varf]=true;
    for(auto i:L[varf])
        if(!viz[i])
            DFS(i);
    ++k;
    topsort[k]=varf;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        L[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            DFS(i);
    for(int i=k;i>=1;i--)
        fout<<topsort[i]<<" ";
    fout<<"\n";
    fin.close();
    fout.close();
    return 0;
}