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

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

vector<int> L[100001];
int n , m , viz[100001] , nod[100001] , p;

void DFS(int k)
{
    viz[k] = 1;
    for(int i : L[k])
        if(!viz[i]) DFS(i);
    nod[++p] = k;
}

void SortTop()
{
    int k;
    for(k = 1;k <= n;k++)
        if(viz[k] == 0) DFS(k);
    for(k = n;k >= 1;k--)
        fout << nod[k] << " ";
}

int main()
{
    int i , j , k , nr = 0;
    fin >> n >> m;
    for(k = 1;k <= m;k++)
    {
        fin >> i >> j;
        L[i].push_back(j);
    }
    SortTop();
    return 0;
}