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

int s[N_MAX+1], n, m,nr;
bool used[N_MAX+1];
struct nod
{
    int val;
    nod *next;
};

nod *L[N_MAX+1];

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

void Read()
{
    int i, a, b;
    FILE *fin = fopen("sortaret.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        Insert(a,b);
    }
    fclose(fin);
}

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

void Write()
{
    FILE *fout = fopen("sortaret.out","w");
    for(int i=nr-1; i>=0; i--)
        fprintf(fout,"%d ",s[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

int main()
{
    Read();
    for(int i=1; i<=n; i++)
        if(!used[i])
            DFS(i);
    Write();
    return 0;
}