#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

#define MAX_N 50005
#define inFile "sortaret.in"
#define outFile "sortaret.out"

short last[MAX_N];
vector<short> next[MAX_N], sol;
queue<short> q;

int main() {
    freopen(inFile, "r", stdin);
    freopen(outFile, "w", stdout);
    
    int n, m, i, x, y, current, next_curr;
    
    scanf("%d%d", &n, &m);
    for(i = 1; i <= m; i++) {
        scanf("%d%d", &x, &y);
        last[y]++;
        next[x].push_back(y);
    }
    
    for(i = 1; i <= n; i++)
        if(!last[i])
            q.push(i);
    
    while(!q.empty()) {
        current = q.front();
        for(i = 0; i < next[current].size(); i++) {
            last[next[current][i]]--;
            if(!last[next[current][i]])
                q.push(next[current][i]);
        }
        q.pop();
        sol.push_back(current);
    }
    
    for(i = 0; i < sol.size(); i++)
        printf("%d ", sol[i]);
    
    return 0;
}