#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

const int mxN = 5e4 + 1;

int in_deg[mxN], n, m;
vector<int> G[mxN];
queue<int> Q;

int main(){
    int a, b;
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> a >> b;
        G[a].push_back(b);
        in_deg[b]++;
    }

    for(int i = 1; i <= n; i++)
        if(!in_deg[i])
            Q.push(i);

    while(!Q.empty()){
        int nod = Q.front();
        Q.pop();
        fout << nod << " ";

        for(int x : G[nod]){
            in_deg[x]--;
            if(!in_deg[x])
                Q.push(x);
        }
    }
}