#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int r[100010];
vector<int> adj[100010];
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        r[v]++;
    }
    priority_queue<int, vector<int>, greater<int>> tp;
    for (int i = 0; i < n; i++) {
        if (!r[i])
            tp.push(i);
    }
    while (!tp.empty()) {
        int u = tp.top();
        tp.pop();
        cout << u << ' ';
        for (int v : adj[u]) {
            r[v]--;
            if (!r[v])
                tp.push(v);
        }
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int in[100010],head[1000010],t[100010],maxn[1000010],n,cnt,ans;
struct e{
	int to,next;
}edge[100010];
queue<int> q;
void add(int x,int y){
	edge[++cnt].to = y;
	edge[cnt].next = head[x];
	head[x] = cnt;
}
void init(){
	int x, y;
	memset(head,-1,sizeof head);
	cin >> n;
	for (int i = 1;i <= n;i++) {
		cin >> x >> y;
		t[x] = y;
		cin >> y;
		while (y){
			add(y, x);
			in[x]++;
			cin >> y;
		}
	}
}
void tps(){
	for(int i = 1;i <= n;i++){
		if(!in[i]){
			q.push(i);
			maxn[i] = t[i];
		}
	}
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i = head[u];i != -1;i = edge[i].next){
			int v = edge[i].to;
			in[v]--;
			maxn[v] = max(maxn[u] + t[v],maxn[v]);
			ans = max(ans,maxn[v]);
			if(!in[v]){
				q.push(v);
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	init();
	tps();
	cout << ans;
	return 0;
}

#include <bits/stdc++.h>
#define MAXN 1000010
using namespace std;
struct edge {
    int next, to;
} edge[MAXN];
int a[MAXN], head[MAXN], ans, cnt, r[MAXN];
bool v[MAXN];
queue<int> q;
void init() {
    memset(head, 0, sizeof head);
    memset(a, 0, sizeof a);
    memset(edge, 0, sizeof edge);
    memset(r, 0, sizeof r);
    memset(v, 0, sizeof v);
    ans = 0;
    cnt = 0;
}
void add(int x, int y) {
    edge[++cnt].to = y;
    edge[cnt].next = head[x];
    head[x] = cnt;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        int n, m, y;
        cin >> n;
        init();
        for (int i = 1; i <= n; i++) {
            cin >> a[i] >> m;
            v[a[i]] = true;
            for (int j = 0; j < m; j++) {
                cin >> y;
                add(a[i], y);
                r[y]++;
            }
        }
        for (int i = 1; i <= n; i++) {
            if (!r[a[i]])
                q.push(a[i]);
        }
        while (!q.empty()) {
            ans++;
            int x = q.front();
            q.pop();
            for (int i = head[x]; i; i = edge[i].next) {
                int y = edge[i].to;
                r[y]--;
                if (!r[y] and v[y])
                    q.push(y);
            }
        }
        if (ans == n)
            cout << "YES" << endl;
        else
            cout << n - ans << endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 10001;
int indegree[N], head[N], t[N], maxt[N], n, tot, ans;
struct nec {
    int to, nxt;
} edge[9999999];
queue<int> q;
void add(int x, int y) {
    tot++;
    edge[tot].to = y;
    edge[tot].nxt = head[x];
    head[x] = tot;
}
void init() {
    int x, y;
    memset(head, -1, sizeof head);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x >> y;
        t[x] = y;
        cin >> y;
        while (y) {
            add(y, x);
            indegree[x]++;
            cin >> y;
        }
    }
}
void topsort() {
    for (int i = 1; i <= n; i++)
        if (!indegree[i]) {
            q.push(i);
            maxt[i] = t[i];
        }
    while (!q.empty()) {
        for (int k = head[q.front()]; k != -1; k = edge[k].nxt) {
            int u = q.front(), v = edge[k].to;
            indegree[v]--;
            maxt[v] = max(maxt[u] + t[v], maxt[v]);
            ans = max(ans, maxt[v]);
            if (!indegree[v])
                q.push(v);
        }
        q.pop();
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    init();
    topsort();
    cout << ans;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, t, cnt, fa[200001], ans = 0x3f3f3f3f;
int find(int x) {
    cnt++;
    if (fa[x] == x)
        return x;
    return find(fa[x]);
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int i = 1; i <= n; i++) {
        cnt = 0;
        cin >> t;
        if (find(t) == i)
            ans = min(ans, cnt);
        else
            fa[i] = t;
    }
    cout << ans;
    return 0;
}

#include <bits/stdc++.h>
#define PIC pair<int, char>
using namespace std;
int dist[30][30], f[30][30],now;
bool flag = true;
int n, m;
int Floyed() {
    memcpy(f, dist, sizeof f);
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                dist[i][j] |= dist[i][k] & dist[k][j];
                if (f[i][j] == f[j][i] && f[i][j] && i != j) {
                    return 1;
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (f[i][j] == f[j][i] && !f[i][j] && i != j) {
                return 2;
            }
        }
    }
    return 3;
}
int main() {
    cin >> n >> m;
    while (n) {
        flag = true;
        memset(dist, 0, sizeof dist);
        memset(f, 0, sizeof f);
        for (int i = 1; i <= m; i++) {
            char s[6];
            scanf("%s", s);
            dist[s[0] - 'A'][s[2] - 'A'] = 1;
            now = Floyed();
            if (flag) {
                if (now == 1) {
                    flag = false;
                    cout << "Inconsistency found after " << i << " relations.";
                } else if (now == 3) {
                    flag = false;
                    cout << "Sorted sequence determined after " << i << " relations: ";
                    PIC ans[30];
                    for (int j = 0; j < n; j++) {
                        ans[j].first = 0;
                        ans[j].second = j + 'A';
                    }
                    for (int j = 0; j < n; j++) {
                        for (int k = 0; k < n; k++) {
                            if (f[j][k])
                                ++ans[k].first;
                        }
                    }
                    sort(ans, ans + n);
                    for (int j = 0; j < n; j++) printf("%c", ans[j].second);
                    cout << '.';
                }
            }
        }
        if (flag) {
            cout << "Sorted sequence cannot be determined.";
        }
        cout << endl;
        cin >> n >> m;
    }

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 30;
int n, m, d[N][N], e[N][N], now;
int floyd() {
    memcpy(e, d, sizeof e);  //复制数组
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) {
                e[i][j] |= e[i][k] & e[k][j];
                if (e[i][j] == e[j][i] & e[i][j] && i != j)
                    return -1;
            }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (e[i][j] == e[j][i] && !e[i][j] && i != j)
                return 0;
    return 1;
}
void paixv() {
    memset(d, 0, sizeof d);
    bool flag = 1;
    for (int i = 1; i <= m; i++) {
        char s[6];
        scanf("%s", s);
        d[s[0] - 'A'][s[2] - 'A'] = 1;
        if (flag) {
            int now = floyd();
            if (now == -1) {
                printf("Inconsistency found after %d relations.\n", i);
                flag = 0;
            } else if (now == 1) {
                printf("Sorted sequence determined after %d relations: ", i);
                pair<int, char> ans[N];
                for (int j = 0; j < n; j++) {
                    ans[i].first = 0;
                    ans[j].second = 'A' + j;
                }
                for (int j = 0; j < n; j++)
                    for (int k = 0; k < n; k++)
                        if (e[j][k])
                            ++ans[k].first;
                sort(ans, ans + n);
                for (int j = 0; j < n; j++) printf("%c", ans[j].second);
                printf(".\n");
                flag = 0;
            }
        }
    }
    if (flag)
        printf("Sorted sequence cannot be determined.\n");
}
int main() {
    while (cin >> n >> m && n) paixv();
    return 0;
}