#include <fstream>
#include <queue>
#include <vector>
using namespace std;

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

int main()
{
    int n,m;

    f>>n>>m;

    vector<int> v[50001];
    int in[50001]={};

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

    queue<int> q;
    for(int i=1;i<=n;i++)
        if(!in[i]){
            q.push(i);
            g<<i<<" ";
        }

    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(unsigned j=0;j<v[x].size();j++){
            in[v[x][j]]--;
            if(!in[v[x][j]]){
                g<<v[x][j]<<" ";
                q.push(v[x][j]);
            }
        }
    }

    return 0;
}