#include <bits/stdc++.h>
using namespace std;
const int N = 50010;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[N];
stack <int> ans;
int n, m, viz[N];
void DFS(int);
int main()
{
    f >> n >> m;
    for(; m; m--)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            DFS(i);
    for(;!ans.empty();ans.pop())
        g << ans.top() << ' ';
    return 0;
}
void DFS(int nod)
{
    viz[nod] = 1;
    for(auto it:v[nod])
        if(!viz[it])
            DFS(it);
    ans.push(nod);
}