#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define cin f
#define cout g
const int NMAX = 1000001;
int n, m, gr[NMAX];
vector<int> v[NMAX];
queue<int> q;
int main()
{
    f >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f >> x >> y;
        v[x].push_back(y);
        gr[y]++;
    }
    for(int i=1; i<=n; i++)
        if(gr[i]==0)
            q.push(i);

    while(!q.empty())
    {
        cout << q.front() << " ";
        int curent = q.front();
        q.pop();
        for(int i=0; i<v[curent].size(); i++)
        {
            int vecin = v[curent][i];
            gr[vecin]--;
            if(gr[vecin]==0)
                q.push(vecin);
        }
    }
}