#include <bits/stdc++.h>
using namespace std;

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

const int MAXN=50005;
int n, m, x, y, viz[MAXN];
vector < int > graf[MAXN];
stack  < int > stiva;

void dfs(int nod)
{
    viz[nod] = 1;
    for(auto it: graf[nod])
        if(!viz[it])
            dfs(it);

    stiva.push(nod);
}

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin>>x>>y;
        graf[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);

    while(!stiva.empty())
    {
        fout<< stiva.top()<<" ";
        stiva.pop();
    }


}