#include<cstdio>
#include<cstdlib>
#define MAX_N 50000
using namespace std;

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

node* L[MAX_N + 1];
int st[MAX_N], n, m, k;
bool used[MAX_N + 1];

inline void Insert(int x, int y)
{
    node* elem = (node*)malloc(sizeof(node));
    elem->val = y;
    elem->next = L[x];
    L[x] = elem;
}

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

int main()
{
    int i, x, y;
    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",&x,&y);
        Insert(x,y);
    }
    fclose(fin);
    for(i=1; i<=n; i++)
        if(!used[i])
            DFS(i);
    for(i=k-1; i>=0; i--)
        fprintf(fout,"%d ",st[i]);
    fprintf(fout,"\n");
    fclose(fout);
    return 0;
}