#include <bits/stdc++.h>
using namespace std;

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

int viz[50005], st[50005];
int n, top, x, y, m;
vector<int> a[50005];

void DFS(int i)
{
    viz[i] = 1;
    for(auto w : a[i])
        if(viz[w] == 0) DFS(w);
    st[++top] = i;
}

int main()
{
    int i;
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(viz[i] == 0) DFS(i);
    for(i=n;i>=1;i--)
        fout << st[i] << " ";
    fin.close();
    fout.close();
    return 0;
}