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

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int M,N,x,y,list[50001],k;
vector <int> G[50001];
bool Use[50001];

void dfs(int nod)
{
    Use[nod]=1;
    for(int i=0;i<G[nod].size();i++)
        if(!Use[G[nod][i]])
            dfs(G[nod][i]);
    list[k++]=nod;
}
int main()
{
    int i;
    fin>>N>>M;
    for(i=0;i<M;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(i=1;i<=N;i++)
        if(!Use[i])
            dfs(i);
    for(i=N-1;i>=0;i--)
        fout<<list[i]<<" ";
    fout<<"\n";
    return 0;
}