#include <cstdio>
#include <vector>
#include <queue>
#define N 50001

using namespace std;

int V[N],n,m,i,x,y;
vector<int> L[N];
vector<int>::iterator it;
queue<int> C;

int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d\n",&n,&m);
	for (i=1; i<=m; i++)
	{
	    scanf("%d%d\n",&x,&y);
	    L[x].push_back(y);
	    V[y]++;
	}
    for (i=1; V[i] && i<=n; i++);
    for (C.push(i); !C.empty(); C.pop())
    {
        printf("%d ",C.front());
        for (it=L[C.front()].begin(); it!=L[C.front()].end(); it++)
        {
            V[*it]--;
            if (!V[*it]) C.push(*it);
        }
    }

    return 0;
}