#include <bits/stdc++.h>

using namespace std;

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

int n,m;
vector<int>L[50002];
int gi[500002];

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int x,y;
        fin>>x>>y;
        L[x].push_back(y);
        gi[y]++;
    }

    queue<int>q;
    for(int i=1;i<=n;++i)
        if(gi[i]==0)
            q.push(i);
    vector<int>rasp;
    while(!q.empty())
    {
        int nod=q.front();
        rasp.push_back(nod);
        q.pop();
        for(auto it : L[nod])
        {
            gi[it]--;
            if(gi[it]==0)
                q.push(it);
        }
    }

    for(auto it : rasp)
        fout<<it<<' ';
    return 0;
}