#include<cstdio>
#define N_MAX 50001
using namespace std;

int n, m, v[N_MAX], l;
bool used[N_MAX];

struct nod
{
    int val;
    nod *next;
};

nod *L[N_MAX];

void DFS(int x)
{
    used[x] = 1;
    nod *p = L[x];
    while(p != NULL)
    {
        if(!used[p->val])
            DFS(p->val);
        p = p->next;
    }
    v[l++] = x;
}

int main()
{
    int i, a, b;
    FILE *fin, *fout;
    fin = fopen("sortaret.in","r");
    fout = fopen("sortaret.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        nod *elem = new nod;
        elem->val = b;
        elem->next = L[a];
        L[a] = elem;
    }
    fclose(fin);
    for(i=1; i<=n; i++)
        if(!used[i])
            DFS(i);
    for(i=l-1; i>=0; i--)
        fprintf(fout,"%d ",v[i]);
    fprintf(fout,"\n");
    fclose(fout);
    return 0;
}