#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

vector <int> v[50001];
queue <int> q;
int n,m,x,y,grad[50001],sol[50001],nr;

ofstream out("sortaret.out");

void sortare()
{
    int a,i;
    while(!q.empty())
    {
        a=q.front();
        {
            for(i=0; i<v[a].size(); i++)
            {
                grad[v[a][i]]--;
                if(grad[v[a][i]]==0)
                {
                    q.push(v[a][i]);

                }
            }
          out<<a<<" ";
        }
        q.pop();
    }
}

int main()
{
    ifstream in("sortaret.in");
    in>>n>>m;
    for(int i=0; i<m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1; i<=n; i++)
        if(grad[i]==0)
            q.push(i);

    sortare();

}