#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define DM 100005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, a, b, top, viz[DM], st[DM];
vector <int> g[DM];

void dfs(int nod)
{
    viz[nod] = 1;
    for(auto it : g[nod])
        if(!viz[it])
            dfs(it);
    st[++top] = nod;
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b;
        g[a].push_back(b);
    }

    for(int i = 1; i <= n; i++)
        if(!viz[i])
            dfs(i);
    for(int i = top; i >= 1; i--)
        fout << st[i] << ' ';
    return 0;
}