#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <functional>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 510;
int n, m, cnt;
int h[N], e[N], ne[N], idx;
int d[N], ans[N]; // q[]存拓扑序列,d[]存每个点的入度
void add(int a, int b) // 添加一条边a->b
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void topsort()
{
priority_queue<int, vector<int>, greater<int> > q;
// 第一步寻找入度为零的点并插入队列
for (int i = 1; i <= n; i ++ )
if (!d[i])
q.push(i);
while (q.size())
{
int t = q.top(); // 每次取出队头判断
q.pop();
ans[cnt ++ ] = t;
for (int i = h[t]; i != -1; i = ne[i])
{
int j = e[i];
if (-- d[j] == 0)
q.push(j);
}
}
}
int main()
{
while (~scanf("%d%d", &n, &m))
{
memset(h, -1, sizeof h);
memset(d, 0, sizeof d);
idx = 0;
cnt = 0;
while (m -- )
{
int a, b;
scanf("%d%d", &a, &b);
add(a, b);
d[b] ++ ; // b点的入度+1
}
topsort();
for (int i = 0; i < cnt; i ++ )
{
if (i != cnt - 1) printf("%d ", ans[i]);
else printf("%d\n", ans[i]);
}
}
return 0;
}