#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<vector<int>>g;
vector<int>grad;
queue<int>q;
int main()
{
    int n,m,x,y;
    fin>>n>>m;
    grad.resize(n+1);
    g.resize(n+1);
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        grad[y]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(grad[i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int nod=q.front();
        fout<<nod<<" ";
        q.pop();
        for(int vecin:g[nod])
        {
            grad[vecin]--;
            if(grad[vecin]==0)
            {
                q.push(vecin);
            }
        }
    }


}