#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50001;
int N, M;

vector<int> A[NMAX];
int grad[NMAX], top[NMAX], nr = 0;
bool v[NMAX];

void dfs(int i) {
    v[i] = 1;
    top[++nr] = i;
    for(const auto& vec: A[i])
        if(!v[vec])
            dfs(vec);

}

int main()
{
    in >> N >> M;

    int x, y;
    for(int i = 1; i <= M; i++) {
        in >> x >> y;
        A[x].push_back(y);
        grad[y]++;
    }


    for(int i = 1; i <= N; i++)
        if(grad[i] == 0) {
            dfs(i);
            break;
        }

    for(int i = 1; i <= N; i++)
        out << top[i] << ' ';
    return 0;
}