#include <fstream>
#include <vector>
using namespace std;
int  k=0;
int timp[50001], vis[50001];
void dfs(int nod, vector <int> a[], int n){
    vis[nod]=1;
    int i;
    k++;
    for (i=0; i<a[nod].size(); i++){
        if (vis[a[nod][i]]==0){dfs(a[nod][i], a, n);}
    }
    k++;
    timp[nod]=k;

}

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n, m, e1, e2, i;
    in>>n>>m;
    vector <int> a[n+1];
    for (i=1; i<=m; i++){
        in>>e1>>e2;
        a[e1].push_back(e2);
    }
    for (i=1; i<=n; i++){
        vis[i]=0;
    }


    for (i=1; i<=n; i++){
        if(vis[i]==0){dfs(i, a, n);}
    }

    int ordine[n+1];
    for (i=1; i<=n; i++){
        ordine[i]=i;
    }
    while (k>0){
        for (i=1; i<=n; i++){
            if (timp[i]==k){out<<i<<" ";}
        }
        k--;
    }

    return 0;
}