#include <fstream>
#include <vector>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
const int nmax=5e4+3;
int viz[nmax],sol[nmax],k,n,m,a,b;
vector <int> v[nmax];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();++i)
    {
        if(viz[v[nod][i]]) continue;
        dfs(v[nod][i]);
    }
    sol[++k]=nod;
}
int main()
{
    f>>n>>m;
    while(m--)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;++i) if(!viz[i]) dfs(i);
    for(int i=n;i>=1;--i) g<<sol[i]<<' ';
    return 0;
}