#include <bits/stdc++.h>
#define pb push_back
using namespace std;


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

vector <int> v[50005];
queue <int> q;
int n, m,j , x, y;
int  grad[50005] ={};


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

    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].pb(y);
        grad[y]++;
    }

    for(int i=1; i<=n; i++)
    {
        if(grad[i]==0)
        {
            q.push(i);
        }
    }

    while(q.empty()==0)
    {
        x=q.front(),q.pop();
        fout << x << ' ';
        for(int i:v[x])
        {
            grad[i]--;
            if(grad[i] == 0)
            {
                q.push(i);
            }
        }
    }




    return 0;
}