#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

#define MAXN 50005

typedef vector<int>::iterator iter;
typedef vector<int>::reverse_iterator riter;

FILE* f = fopen("sortaret.in", "r");
FILE* g = fopen("sortaret.out", "w");

int n, m;
vector<int> G[MAXN];
bitset<MAXN> viz;
vector<int> order;

void topo(int i)
{
    if (viz[i] == true) {
        return;
    }
    viz[i] = true;

    for (iter it = G[i].begin(); it != G[i].end(); it++) {
        topo(*it);
    }
    order.push_back(i);
}

int main()
{
    fscanf(f, "%d %d\n", &n, &m);
    for (int i = 1, x, y; i <= m; i++) {
        fscanf(f, "%d %d\n", &x, &y);
        G[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        topo(i);
    }

    for (riter it = order.rbegin(); it != order.rend(); it++) {
        fprintf(g, "%d ", *it);
    }

    fclose(f);
    fclose(g);
    return 0;
}