#include <bits/stdc++.h>

using namespace std;

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

int n, m;

vector <int> v[50005];
int afis[50005], k;
bool viz[50005];

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

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

    afis[++k] = node;
}



int main()
{

    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++)
        if(viz[i] == false)
            dfs(i);

    for(int i = n; i >= 1; i--)
        fout << afis[i] << " ";

    return 0;
}