#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<int>a[50005];
int viz[50005];
int cnt;
int n, m;
int rasp[50005];
void dfs(int x)
{
    viz[x] = 1;
    for(int i = 0; i < a[x].size() ; i++)
    {
        //cout << i << " " << a[x][i] << " ";
        if(viz[a[x][i]] == 0)
        {
            dfs(a[x][i]);
        }
    }
    rasp[cnt] = x;
    cnt++;

}
int main()
{
    int x, y;
    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 = cnt - 1; i >= 0; i--)
    {
        out << rasp[i] << " ";
    }

    return 0;
}