#include <bits/stdc++.h>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int N = 5e4 + 1;
int n, m, x, y, nr[N];
vector<int> c[N];

void bfs(){
    queue<int> q;
    for(int i = 1; i <= n; i++){
        if(nr[i] == 0)
            q.push(i);
    }

    while(!q.empty()){
        int tata = q.front();
        g << tata << ' ';
        for(int fiu: c[tata]){
            nr[fiu]--;
            if(nr[fiu] == 0)
                q.push(fiu);
        }

        q.pop();
    }
}

int main(){
    f >> n >> m;
    for(int i = 0; i < m; i++){
        f >> x >> y;
        c[x].push_back(y);
        nr[y]++;
    }

    f.close();
    bfs();
    g.close();
}