#include <cstdio>
#include <vector>
#include <deque>

using namespace std;
FILE* f, * g;

vector <int> v[50002];
deque <int> coada;
bool viz[50002];

void dfs(int nod)
{
    viz[nod] = 1;
    for (int i = 0;i < v[nod].size();++i)
        if (!viz[v[nod][i]])
            dfs(v[nod][i]);
    coada.push_back(nod);
}
int main()
{
    f = fopen("sortaret.in", "r");
    g = fopen("sortaret.out", "w");
    int n, m, x, y;
    fscanf(f, "%d %d", &n, &m);
    for (int i = 1;i <= m;++i)
    {
        fscanf(f, "%d %d", &x, &y);
        v[x].push_back(y);
    }
    for (int i = 1;i <= n;++i)
        if (!viz[i])
            dfs(i);
    int nod;
    while (!coada.empty())
    {
        nod = coada.back();
        fprintf(g, "%d ", nod);
        coada.pop_back();
    }
    fclose(f);
    fclose(g);
}