#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, len, v[50005];
bool viz[50005];
vector<int> L[50005];

void DFS_T(int k)
{
    viz[k] = 1;
    for(int i : L[k])
        if(viz[i] == 0) DFS_T(i);
    v[++len] = k;
}

void TopSort()
{
    for(int i = 1; i <= n; i++)
        if(viz[i] == 0) DFS_T(i);
}

int main()
{
    int i, j;
    fin >> n >> m;
    for(int pas = 1; pas <= m; pas++)
    {
        fin >> i >> j;
        L[i].push_back(j);
        //L[j].push_back(i);
    }
    TopSort();
    for(i = n; i >= 1; i--)
        fout << v[i] << " ";
    return 0;
}