#include <cstdio>
#include <cstdlib>
#define maxn 50001

struct nod { int x; nod *n;};

int n;
int sol[maxn],ns;
bool use[maxn];
nod *a[maxn];

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


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

int main()
{
    freopen("sortaret.in","r",stdin);
    int m, p, q;
    nod *t;
    scanf("%d %d\n", &n,&m);
    while(m--)
    {
	scanf("%d %d\n", &p, &q);
	t=new nod;
	t->x=q;
	t->n=a[p];
	a[p]=t;
    }
    
    int i;
    for(i=1;i<=n;++i)
	if(!use[i]) dfs(i);

freopen("sortaret.out","w",stdout);
    for(i=n;i>=1;--i)printf("%d ", sol[i]);
    printf("\n");
    return 0;
}