#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
vector <int> v[100001];
int solutie[100001],viz[100001],k=0;

void dfs(int nod)
{
    viz[nod]=1;
    for(int j=0;j<v[nod].size();j++)
        if(viz[v[nod][j]]!=1)
            dfs(v[nod][j]);

    solutie[++k]=nod;
}

int main()
{
    int n,m,x,y;
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    while(m>0)
    {
        f>>x>>y;
        v[x].push_back(y);
        m--;
    }

    for(int i=1;i<=n;i++) if(viz[i]!=1) dfs(i);

    for(int i=n;i>=1;i--) g<<solutie[i]<<" ";
    f.close();
    g.close();
    return 0;
}