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

using namespace std;
int N,M,t[50005],k;
bool viz[50005];
vector <int> a[50005];

void dfs(int nod)
{
    viz[nod]=1;
    t[k++]=nod;
    for(unsigned int i=0;i<a[nod].size();i++)
    {
        if(viz[a[nod][i]]==0)
        dfs(a[nod][i]);
    }
}

int main()
{
    int i,x,y;
    ifstream fin("sortaret.in");
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    fin.close();
    for(i=1;i<=N;i++)
    {
        if(viz[i]==0) dfs(i);
    }
    ofstream fout("sortaret.out");
    for(i=0;i<k;i++)
        fout<<t[i]<<" ";
    fout.close();
    return 0;
}