#include <cstdio>
#define N 50001
struct nod { int x; nod *n;};

nod *a[N];
int n, m, st[N], nst;
bool use[N];

inline void add(int i,int j)
{
    nod *p=new nod;
    p->x=j;
    p->n=a[i];
    a[i]=p;
}

void read()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d %d\n", &n, &m);
    int p, q;
    nod *t;
    while(m--)
    {
	scanf("%d %d\n", &p,&q);
	add(p,q);
    }
}

inline void dfs(int n)
{
    use[n]=1;

    for(nod *i=a[n]; i; i=i->n)
	if(!use[i->x])
	    dfs(i->x);
    st[++nst]=n;
}

int main()
{
    freopen("sortaret.out","w",stdout);
    read();
    int i;
    for(i=1;i<=n;++i) 
	if(!use[i]) dfs(i);
    
    for(i=n;i;--i)printf("%d ", st[i]);
    printf("\n");
    return 0;
}