#include <iostream>
#include<vector>
#include<fstream>
#include<queue>
#define N 50001
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m;
vector<vector<int> > G(N);
vector<int> grade(N,0);

void citire()
{
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int a,b;
        f>>a>>b;
        G[a].push_back(b);
        grade[b]++;
    }
}

void sort_top()
{
    queue<int> q;
    for(int i=1;i<=n;i++)
        if(grade[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int nod=q.front();
        g<<nod<<" ";
        for(auto i:G[nod])
        {
            grade[i]--;
            if(grade[i] == 0)
                q.push(i);
        }
        q.pop();
    }
}

int main()
{
    citire();
    sort_top();
    return 0;
}