#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector <int> q;
vector <int> v[50005];
bool visited[50005];

void TopSort(int x)
{
    if(!visited[x])
        visited[x] = 1;

    for(int i = 0; i < v[x].size(); i++)
        if(!visited[v[x][i]])
            TopSort(v[x][i]);

    q.push_back(x);
}

int main()
{
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int node, to;
        fin >> node >> to;
        v[node].push_back(to);
    }
    for(int i = 1; i <= n; i++)
        if(!visited[i])
            TopSort(i);

    for(int i = q.size() - 1; i >= 0; i--)
        fout << q[i] << ' ';
    return 0;
}