#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax=1e5;
vector <int> graf[nmax+5];
vector <int> topo;
int Use[nmax+5];
void DFS(int nod)
{
    Use[nod]=1;
    for(auto vecin : graf[nod])
    {
        if(Use[vecin]==0)
            DFS(vecin);
    }
    topo.push_back(nod);
}
int main()
{
    int x,y,n,m;
    fin>>n>>m;
    for(int i=0; i<m; i++)
    {
        fin>>x>>y;
        graf[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        if(!Use[i])
            DFS(i);
    for(int i=topo.size()-1; i>=0; i--)
        fout<<topo[i]<<" ";
    return 0;
}