#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

const int nmax=50005;

vector <int> graph_orientat[nmax];
int ordine[nmax];
int k;
bool aparut[nmax];
vector <int> ordine_aparitii;
vector <int> coada_afisare;

void sortaret(int start_node)
{
    coada_afisare.push_back(start_node);
    ordine[start_node]=k;
    for(int i=0;i<graph_orientat[start_node].size();i++)
    {
        if(ordine[graph_orientat[start_node][i]]==0)
        {
            k++;
            sortaret(graph_orientat[start_node][i]);
        }
    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int n, m;

    scanf("%d%d", &n, &m);
    for(int i=1;i<=m;i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        graph_orientat[a].push_back(b);
        if(aparut[a]==false)
        {
            aparut[a]=true;
            ordine_aparitii.push_back(a);
        }
    }
    k=1;
    for(int i=0;i<ordine_aparitii.size();i++)
    {
        if(ordine[ordine_aparitii[i]]==0)
            sortaret(ordine_aparitii[i]);
    }
    for(int i=0;i<coada_afisare.size();i++)
        printf("%d ", coada_afisare[i]);
    printf("\n");

    return 0;
}