#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define s second
#define f first
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50010];
priority_queue <pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > q;
int x,y,t[50010],i,m,n,j;
pair<int,int>aux;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        t[y]++;
    }
    for(i=1;i<=n;i++)
    {
        q.push(make_pair(t[i],i));
    }
    for(i=1;i<=n;i++)
    {
        aux=q.top();
        q.pop();
        fout<<aux.s<<" ";
        for(j=0;j<v[aux.s].size();j++)
        {
            t[v[aux.s][j]]--;
            q.push(make_pair(t[v[aux.s][j]],v[aux.s][j]));
        }
    }
    return 0;
}