#include <bits/stdc++.h>
#define INF 1e9
using namespace std;

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

vector <int> v[100005];

bool viz[100005];

vector <int> ans;

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

    viz[node] = true;

    for(int i = 0; i < v[node].size(); i++)
        dfs(v[node][i]);

    ans.push_back(node);
}

int main()
{
    int N, M;

    fin >> N >> M;

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

        fin >> x >> y;

        v[x].push_back(y);
    }

    for(int i = 1; i <= N; i++)
        dfs(i);

    reverse(ans.begin(), ans.end());

    for(int i = 0; i < N; i++)
        fout << ans[i] << " ";

    return 0;
}