#include <bits/stdc++.h>

using namespace std;

const int MAX = 50001;

vector <int> a[MAX];
vector <int> q;
bool viz[MAX];
int n, m, x, y;

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

void dfs(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i < a[nod].size(); i++)
    {
        if(viz[a[nod][i]] == 0)
        {
            dfs(a[nod][i]);
        }
    }
    q.push_back(nod);
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        in >> x >> y;
        a[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            dfs(i);
        }
    }
    for(int i = q.size() - 1; i >= 0; i--)
    {
        out << q[i] << " ";
    }
    return 0;
}