#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std;

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

const int Max = 5e4 + 1;

vector<int> graph[Max], a;
bitset<Max> v;

void dfs(int node)
{
    v[node] = 1;
    for(int i: graph[node])
        if(!v[i])
            dfs(i);
    a.push_back(node);
}

int main()
{
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(!v[i])
            dfs(i);
    reverse(a.begin(), a.end());
    for(int i: a)
        fout << i << " ";

    fin.close();
    fout.close();
    return 0;
}