#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int N = 50005;

int n, m;
vector<int> graf[N], S;
int viz[N];

void dfs(int nod)
{
    viz[nod] = 1;
    for(int y : graf[nod])
        if(!viz[y])
            dfs(y);

    S.push_back(nod);
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        graf[x].push_back(y);
    }

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

    for(int i = S.size() - 1; i >= 0; i--)
        g << S[i] << ' ';


    return 0;
}