Ordering Tasks

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (111)
vi g[MX];
int T[MX],L,cn[MX],S;
void dfs(int u,bool x=0){
    if(cn[u]++)return;
    F((ll)g[u].size())dfs(g[u][i],x);
    if(x)T[L++]=u;
}
#define ts(N) F(N)if(!cn[i])dfs(i,1);F(N>>1)swap(T[i],T[N-i-1]);
#define CLR F(N)g[i].clear();L=0;CL(cn,0);
int N,M,a,b;
int main(void){
    while(scanf("%d%d",&N,&M),N){
        CLR F(M)scanf("%d%d",&a,&b),g[--a].PB(--b);
        ts(N)
        F(N)printf("%d%c",T[i]+1,i+1==N?10:32);
    }
    return 0;
}