#include<cstdio>
#define NMAX 50002
using namespace std;

bool viz[NMAX];
int v[NMAX], n, m, nr;

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

nod *L[NMAX];

void adauga(int x, int y)
{
    nod *elem = new nod;
    elem->val = y;
    elem->next = L[x];
    L[x] = elem;
}

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

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

void Write(char nume_fout[30])
{
    FILE *fout = fopen(nume_fout,"w");
    for(int i=nr-1; i>=0; i--)
        fprintf(fout,"%d ",v[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

void Read(char nume_fin[30])
{
    int i, a, b;
    FILE *fin = fopen(nume_fin,"r");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        adauga(a,b);
    }
    fclose(fin);
}

int main()
{
    Read("sortaret.in");
    Sortare_Topologica();
    Write("sortaret.out");
    return 0;
}