#include <bits/stdc++.h>
#include <fstream>
using namespace std;

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

vector<int> mat[100005];
int gradInt[100005];

int main()
{
    int x, y, n, m, i;
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        mat[x].push_back(y);
        gradInt[y]++;
    }

    vector<int> ans;
    queue<int> q;
    for(i=1;i<=n;i++){
        if(gradInt[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        int nodCrt=q.front();
        q.pop();
        ans.push_back(nodCrt);

        for(auto vecin:mat[nodCrt]){
            gradInt[vecin]--;
            if(gradInt[vecin]==0)
                q.push(vecin);
        }
    }
    for(auto nodCrt:ans)
        fout<<nodCrt<<" ";
}