#include <bits/stdc++.h>

#define MAX1 50010
#define MAX2 100005

using namespace std;

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

vector<int>g[MAX1];
int v[MAX2];

queue<int> q;

int main()
{
    int n,m,i,x,y;

    fin>>n>>m;

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

    for(i=1;i<=n;i++)
    {
        if(v[i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        fout<<q.front()<<" ";
        for(const auto &it : g[q.front()])
        {
            v[it]--;
            if(!v[it])
            {
                q.push(it);
            }
        }
        q.pop();
    }
}