#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int aux[100001],n,m,i,x,y,k,d[50001];
vector <int> v[50001];
queue<int> q;

int main()
{
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        d[y]++;
    }
    k=1;
    for(i=1;i<=n;i++)
    {
        if(d[i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
       int x= q.front();
       q.pop();
       fout << x << ' ';
       for(i=0;i<v[x].size();i++)
       {
            d[v[x][i]]--;
            if(d[v[x][i]]==0)
            {
                q.push(v[x][i]);
            }
       }
    }

    return 0;
}