#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int Maxn=50005;
int n,m;
int viz[Maxn];
vector <int> V[Maxn];
vector <int> S;

void DFS(int nod)
{
    viz[nod]=1;
    for(int i=0;i<V[nod].size();++i)
       if(viz[V[nod][i]]==0) DFS(V[nod][i]);

    S.push_back(nod);
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int x,y;
        fin>>x>>y;
        V[x].push_back(y);
    }

    for(int i=1;i<=n;++i)
       if(viz[i]==0)
        DFS(i);

    for(int i=S.size()-1;i>=0;--i)
       fout<<S[i]<<" ";
    return 0;
}