n, m, k, l, d = map(int, input().split()) row = {} col = {} for _ in range(d): x, y, p, q = map(int, input().split()) if x == p: min_col = min(y,q) if min_col not in col: col[min_col] = 1 else: col[min_col] += 1 else: min_row = min(x,p) if min_row not in row: row[min_row] = 1 else: row[min_row] += 1 row_by_value_desc = sorted(row.items(), key=lambda x: x[1],reverse=True) col_by_value_desc = sorted(col.items(), key=lambda x: x[1],reverse=True) best_row = [] best_col = [] for i in range(k): best_row.append(row_by_value_desc[i][0]) for i in range(l): best_col.append(col_by_value_desc[i][0]) best_row = sorted(best_row) best_col = sorted(best_col) best_row = [str(i) for i in best_row] best_col = [str(i) for i in best_col] print(" ".join(best_row)) print(" ".join(best_col))