#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <queue>

using namespace std;

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

#define nmax 50010
vector <int> v[nmax];
int n,m,i,j,nr,ans[nmax];
bool use[nmax];

void dfs(int x)
{
    use[x]=1;
    for (int i=0; i<v[x].size(); i++)
        if (!use[v[x][i]])
            dfs(v[x][i]);
    ans[++nr]=x;
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=m; i++)
    {
        int a,b;
        fin >> a >> b;
        v[a].push_back(b);
    }
    for (i=1; i<=n; i++)
        if (!use[i])
        dfs(i);
    for (i=nr; i; i--)
        fout << ans[i] << ' ';
    fout << '\n';
}