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

using namespace std;

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

const int NMAX = 50005;

vector <int> g[NMAX];

int inDegree[NMAX];

vector <int> topo;

queue <int> q;

void kahn(){
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        topo.push_back(nod);
        for(int i = 0; i < g[nod].size(); ++i){
            int nodp = g[nod][i];
            if(inDegree[nodp] > 0){
                inDegree[nodp] --;
                if(inDegree[nodp] == 0){
                    q.push(nodp);
                }
            }
        }
    }
}

void solve(){
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        inDegree[y] ++;
    }
    for(int i = 1; i <= n; ++i){
        if(inDegree[i] == 0){
            q.push(i);
        }
    }
    kahn();
    for(int i = 0; i < n; ++i){
        fout << topo[i] << " ";
    }
}

int main()
{
    solve();
    return 0;
}