#include <bits/stdc++.h>
#define NMAX 50005

using namespace std;

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

vector < vector < int > > v;
bool bif[NMAX];
stack < int > sol;

int n, m;

void DFS(int nod)
{
    bif[nod] = 1;

    for(const auto &i : v[nod])
        if(!bif[i])
            DFS(i);

    sol.push(nod);
}

int main()
{
    int x, y;
    f >> n >> m;

    v.resize(n + 1);
    for(int i = 1 ; i <= m ; i++)
        f >> x >> y,
        v[x].push_back(y);

    for(int i = 1 ; i <= n ; i++)
        if(!bif[i])
            DFS(i);

    while(!sol.empty())
        o << sol.top() << ' ',
        sol.pop();

    return 0;
}