#include <fstream>
#include <vector>

using namespace std;

int N,viz[50005],sol[50005],len;
vector <int> L[50005];

inline void Read()
{
    int i,M,X,Y;
    ifstream fin("sortaret.in");
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>X>>Y;
        L[X].push_back(Y);
    }
    fin.close();
}

inline void Dfs(int nod)
{
    int nr,i,j;
    viz[nod]=1;
    nr=L[nod].size();
    for(i=0;i<nr;i++)
    {
        j=L[nod][i];
        if(!viz[j])
            Dfs(j);
    }
    sol[++len]=nod;
}

inline void TopologicSort()
{
    int i;
    for(i=1;i<=N;i++)
        if(!viz[i])
            Dfs(i);

    ofstream fout("sortaret.out");
    for(i=len;i>0;i--)
        fout<<sol[i]<<" ";
    fout<<"\n";
    fout.close();
}

int main()
{
    Read();
    TopologicSort();
    return 0;
}