#include <cstdio>
#include <vector>

using namespace std;

const int Nmax = 100000+2;

vector<int> G[Nmax], ret;
bool c[Nmax];
int s = 0;

void dfs(int x) {
    c[x] = 1;
    for (vector<int>::iterator it = G[x].begin(); it != G[x].end(); ++it)
        if (!c[*it]) dfs(*it);
    ret.push_back(x);
}

int main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    int n, m, i, x, y;
    scanf("%d%d", &n, &m);

    for (i = 1; i <= m; ++i) {
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
    }

    for (i = 1; i <= n; ++i)
        if (!c[i]) dfs(i);

    for (vector<int>::reverse_iterator it = ret.rbegin(); it != ret.rend(); ++it) {
        printf("%d ", *it);
    }

    return 0;
}