#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 50001, M = 100001;
int nr, vf[M], urm[M], lst[N], n, cnt = 0, st[N], pred[N];
bool viz[N];

void adauga(int x, int y)
{
    vf[++nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
    pred[y]++;
}

void dfs(int x)
{
    viz[x] = true;
    for(int p = lst[x]; p != 0; p = urm[p]){
        int y = vf[p];
        if(!viz[y]){
            dfs(y);
        }
    }
    st[++nr] = x;
}

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 0; i < m; i++){
        int x, y;
        in >> x >> y;
        adauga(x, y);
    }
    nr = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }
    for(int i = n; i >= 1; i--){
        out << st[i] << " ";
    }

    return 0;
}