#include <bits/stdc++.h>
using namespace std;

const int NMAX = 5e4;
int grad_interior[NMAX + 1];
vector<int> G[NMAX + 1];

int main() 
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
        grad_interior[y]++;
    }
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        if(grad_interior[i] == 0) {
            q.push(i);
        }
    }
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        cout << x << ' ';
        for(auto vec : G[x]) {
            grad_interior[vec]--;
            if(grad_interior[vec] == 0) {
                q.push(vec);
            }
        }
    }
}