#include <bits/stdc++.h>
#define NMAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int>vecini[NMAX];
int N, M;
bool frec[NMAX];
int rez[NMAX];
void dfs(int nod)
{
    frec[nod] = 1;
    for(int i=0; i<vecini[nod].size(); i++)
    {
        int vec = vecini[nod][i];
        if(frec[vec] == 0)
        {
            dfs(vec);
        }
    }
    rez[++rez[0]] = nod;
}
void afisare()
{
    for(int i=rez[0]; i>=1; i--)
        fout<<rez[i]<<" ";
    fout<<"\n";
}
void citire()
{
    fin>>N>>M;
    int x, y;
    for(int i=1; i<=M; i++)
    {
        fin>>x>>y;
        vecini[x].push_back(y);
    }
    for(int i=1; i<=N; i++)
    {
        if (frec[i] == 0)
            dfs(i);
    }
    afisare();
}
int main()
{
    citire();
    return 0;
}