#include <cstdio>
#include <vector>

using namespace std;

const int nmx = 50005;

int n,m;
bool viz[nmx];
vector <int> G[nmx];
vector <int> R;

void bfs(int pos){
    viz[pos] = 1;
    for(vector<int>::iterator it = G[pos].begin(); it != G[pos].end(); ++it)
        if(not viz[*it])
            bfs(*it);
    R.push_back(pos);
}

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

    scanf("%d %d", &n, &m);
    for(int i = 0; i < m; ++i) {
        static int x, y;
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(not viz[i]) {
            viz[i] = 1;
            bfs(i);
        }
    for(vector<int>::iterator it = R.end()-1; it != R.begin() - 1; --it)
        printf("%d ", *it);

    return 0;
}