//#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

struct stl{
    queue<int> ad;
}v[50000];

int vf[50000];

void dfs(int n,int h)
{
    out<<h<<' ';
    while(! v[h].ad.empty())
    {
        int m=v[h].ad.front();
        v[h].ad.pop();
        dfs(n,m);
    }
}

int main()
{
    int n,m,i,j;

    in>>n>>m;

    while(in>>i)
    {
        in>>j;
        v[i].ad.push(j);
        vf[j]++;
    }

    for(int i=1;i<=n;i++)
        if(vf[i]==0)
            dfs(n,i);

    return 0;
}