#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

vector<int>a[50005];
int nrp[50005];
int main()
{
    queue <int> q;
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n,m;
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }

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

    while(!q.empty())
    {
        int w=q.front();
        q.pop();
        for(auto nod:a[w])
        {
            nrp[nod]--;
            if(nrp[nod]==0)
            {
                q.push(nod);
            }
        }
        out<<w<<" ";
    }

    return 0;
}