#include <bits/stdc++.h>

using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

const int nMax = 50010;

int n, m, i, x, y;
int prez[nMax];
vector <int> v[nMax], ans;

void dfs(int nod)
{
    prez[nod] = 1;
    for(auto it : v[nod])
        if(!prez[it])
            dfs(it);
    ans.push_back(nod);
}

int main()
{
    fin >> n >> m;
    for(i=1; i<=m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        if(!prez[i])
            dfs(i);
    reverse(ans.begin(), ans.end());
    for(auto it : ans)
        fout << it << " ";
    return 0;
}