题解 | 小心火烛的歪，by位运算

from itertools import combinations


def main():
    n, m, q = map(int, input().split())
    gs = "".join(input().strip().replace(" ", "") for _ in range(n))
    g = int(gs, 2)
    ng = ~g & (2 ** (n * m) - 1)  # 非运算并取后 n*m 位
    if ng == 0:
        return 0, None
    ps = [
        int("".join(input().strip().replace(" ", "") for _ in range(n)), 2)
        for _ in range(q)
    ]
    pis = list(range(q))
    for k in range(1, q + 1):
        for tpis in combinations(pis, k):
            x = 0
            opis = []
            for tpi in tpis:
                x |= ps[tpi]  # 或运算
                opis.append(tpi + 1)
                if ng == x:
                    return len(opis), opis
    return -1, None


p, pis = main()
print(p)
if pis is not None:
    print(" ".join(map(str, pis)))