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

using namespace std;

queue<int> q;

vector<int> v[50001];

int n,m,gr[50001];

ifstream mama("sortaret.in");
ofstream tata("sortaret.out");

void graf()
{
    int a,i,k=1;
    while(k<n)
    {
        a=q.front();
        q.pop();
        for(i=0;i<v[a].size();i++)
            gr[v[a][i]]--;
        for(i=1;i<=n;i++)
            if(gr[i]==0) {q.push(i);tata<<i<<" ";gr[i]=-1;k++;}
    }
}

int main()
{
    int a,b,i;



    mama>>n>>m;
    for(i=1;i<=m;i++)
    {
        mama>>a>>b;
        v[a].push_back(b);
        gr[b]++;
    }
    for(i=1;i<=n;i++)
        if(gr[i]==0) {q.push(i);tata<<i<<" ";gr[i]=-1;}
    graf();

    return 0;
}