#include <bits/stdc++.h>
#define NUM 1000005
using namespace std;
vector<int> graf[NUM];
int coada[NUM];
int grad[NUM];
int n, m, a, b;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
void solve()
{
    int x;
    for(int i = 1; i <= n; ++i)
        if(!grad[i])
            coada[++coada[0]] = i;

    for(int i = 1; i <= n; ++i)
    {
        x = coada[i];
        for(int j = 0; j < graf[x].size(); ++j)
        {
            grad[graf[x][j]]--;
            if(!grad[graf[x][j]])
                coada[++coada[0]] = graf[x][j];
        }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 0; i < m; ++i)
    {
        f >> a >> b;
        graf[a].push_back(b);
        grad[b]++;
    }
    solve();
    for(int i = 1; i <= n; ++i)
        g << coada[i] << " ";
    f.close();
    g.close();
}