#include <bits/stdc++.h>
using namespace std;

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

vector <int> adj[50005];

bool viz[50005];
int ans[50005], k;

void dfs(int node)
{
    viz[node] = true;

    for(int i = 0; i < (int)adj[node].size(); i++)
        if(viz[adj[node][i]] == false)
            dfs(adj[node][i]);

    ans[++k] = node;
}

int main()
{
    int N, M;

    fin >> N >> M;

    for(int i = 1; i <= M; i++)
    {
        int x, y;

        fin >> x >> y;

        adj[x].push_back(y);
    }

    for(int i = 1; i <= N; i++)
        if(viz[i] == false)
            dfs(i);

    for(int i = k; i >= 1; i--)
        fout << ans[i] << " ";

    return 0;
}