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

using namespace std;

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

const int NMAX = 50005;

vector<int> g[NMAX];
int deg[NMAX]; /// grad interior
queue<int> q;

int n;

int main()
{
    int m;
    in>>n>>m;

    for(int i=1; i<=m; i++){
        int x, y;
        in>>x>>y;
        g[x].push_back(y);
        deg[y]++;
    }

    for(int i=1; i<=n; i++){
        if(deg[i]==0)
            q.push(i);
        //cout<<deg[i]<<' ';
    }
    //cout<<endl;

    while( !q.empty() ){
        int nod = q.front();
        q.pop();

        out<<nod<<' ';

        for( vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it ){
            int m = *it;
            deg[m]--;
            if(deg[m]==0)
                q.push(m);
        }
    }

    return 0;
}