#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=50001;
vector <int> v[N];
int pred[N],n,m,q[N],st,dr,a,b;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++){
        f>>a>>b;
        v[a].push_back(b);
        pred[b]++;
    }
    for(int i=1;i<=n;i++)
        if(pred[i]==0){
           q[++dr]=i;
        }
    st=1;
    while(st<=dr){
        int x=q[st++];
        g<<x<<' ';
        for(int i=0;i<v[x].size();i++){
            int y=v[x][i];
            pred[y]--;
            if(pred[y]==0)
                q[++dr]=y;
        }
    }
    return 0;
}