#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int INF = 500000, NMAX = 50005;
vector < vector <int> > v;
vector < int > viz, f;
int ans[NMAX];
bool cmp(int a, int b)
{
    return viz[a] < viz[b];
}
void bfs(int nod)
{
    queue <int> q;
    int fr;
    viz[nod] = 0;
    q.push(nod);
    while(!q.empty())
    {
        fr = q.front();
        q.pop();
        for(int i = 0; i < v[fr].size(); i++)
            if(viz[v[fr][i]] > viz[fr] + 1)
            {
                viz[v[fr][i]] = viz[fr] + 1;
                q.push(v[fr][i]);
            }
    }
}
int main()
{
    int n, m, i, a, b;
    fin >> n >> m;
    viz.resize(n);
    f.resize(n);
    for(i = 0; i < n; i++)
        viz[i] = INF;
    v.resize(n);
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b;
        a--;
        b--;
        f[b] = 1;
        v[a].push_back(b);
    }
    for(i = 0; i < n; i++)
        if(!f[i])
            bfs(i);
    for(i = 0; i < n; i++)
        ans[i] = i;
    sort(ans, ans+n, cmp);
    for(i = 0; i < n; i++)
    {
        fout << ans[i] + 1 << ' ';
    }
    return 0;
}