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

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int Nmax=5e4;
int n,m, S[Nmax+3], cnt=0;
bool P[Nmax+3];
vector <int> G[Nmax+3];
void dfs(int nod)
{
    P[nod]=1;
    for(auto nxt : G[nod])
        dfs(nxt);
    S[++cnt]=nod;
}

int main()
{
    f >> n >> m;
    for(int i=1, x, y; i<=m; i++)
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        if(!P[i])
            dfs(i);
    for(int i=cnt; i>=1; i--)
        g << S[i] << " ";
    return 0;
}