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

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

int n, m;
int st[50005], top;
vector<int> a[50005];
bitset<50005> viz;

void DFS(int x)
{
    viz[x] = 1;
    for (int e : a[x])
        if (viz[e] == 0)
            DFS(e);
    st[++top] = x;
}

int main()
{
    int i, j, x, y;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
            DFS(i);
    for (i = n; i >= 1; i--)
        fout << st[i] << " ";
    fout << "\n";
    return 0;
}