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

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

int n,m;

vector <int> G[MAXN];
queue <int> Q;
int grade[MAXN];

void bfs()
{
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        for(auto &x:G[nod])
        {
            grade[x]--;
            if(grade[x]==0)
                Q.push(x);
        }
        fout<<nod<<" ";
    }
}

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

void sortare()
{
    for(int i=1;i<=n;i++)
        if(grade[i]==0)
            Q.push(i);
}
int main()
{
    citire();
    sortare();
    bfs();
    return 0;
}