#include <stdio.h>
#include "heap.h"
#include "Queue.h"

#define MAX_N 100

int toposort(int a[MAX_N + 1][MAX_N + 1], int n, int node, int *ans) {
    int i, j, index[MAX_N + 1];
    struct Queue *q;
    char visited[MAX_N + 1] = {0};

    q = malloc(sizeof(struct Queue));
    init_q(q);

    for (i = 0; i < MAX_N + 1; i++) {
        index[i] = i;
    }

    visited[node];
    enqueue(q, &index[node]);

    while (!is_empty_q(q)) {
        node = *(int*)front(q);
        for (i = 1; i <= n; i++) {
            if (a[i][node] && !visited[i]) {
                }
        }
    }
}

int main() {
    int i, j, n, m, x, y;
    char a[MAX_N+1][MAX_N+1];

    for (i = 0; i < MAX_N + 1; i++) {
        for (j = 0; j < MAX_N + 1; j++) {
            a[i][j];
        }
    }

    scanf("%d %d\n", &n, &m);
    while (m--) {
        scanf("%d %d", &x, &y);
        a[x][y] = 1;
    }

    return 0;
}