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

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int x,y,/*a[101][101],*/ grad[50001], n,m,i,j ;
vector<int> a[50001];
queue<int> coada;

int main()
{
    f>>n;
    f>>m;
    for (i=1;i<=m;i++)   {
        f>>y>>x;
        a[y].push_back(x);
        grad[x]++;
    }
    int k=1;
    for (k=1;k<=n;k++)
    for (i=1;i<=n;i++)   {
            if (grad[i] == 0)   {
                g<<i<<" ";
                for (j=0;j<a[i].size();j++)
                        grad[a[i][j]]--;

                grad[i]=-1;
            }


    }




    return 0;
}