#include <bits/stdc++.h>

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

vector <int> h[50005];
int viz[50005], n , m;
int st[50001], top;

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


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

void Citire ()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x , y;
        fin >> x >> y;
        h[x].push_back(y);
    }
}

void Afisare ()
{
    while (top)
    {
        fout << st[top] << " ";
        top--;
    }
}

int main()
{
    Citire();
    SortTop();
    Afisare();
    return 0;
}