#include <bits/stdc++.h>
#define NMAX 50002
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector<int>a[NMAX];
vector<int> sortare;
queue<int> q;
int d[NMAX]; //d[i]=gradul interior al lui i
int main()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
        d[y]++;
    }
    for(i=1; i<=n; i++)
        if(!d[i])
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        sortare.push_back(x);
        for(i=0; i<a[x].size(); i++)
            {
             d[a[x][i]]--;
             if(!d[a[x][i]])
                q.push(a[x][i]);
            }
    }
    for(i=0; i<sortare.size(); i++)
        fout<<sortare[i]<<' ';

    return 0;
}