from itertools import combinations

def sumsetR(H,A, n):
    SS = set()
    for m in H:
        for i in combinations(A, m):
            SS = SS.union({sum(i) % n})
    return SS

def Z(n): return set([0..n-1])

def muR(n,k,l):
    for m in [0..n]:
        for A in combinations(Z(n),n-m):
            if sumsetR([k],A,n).intersection(sumsetR([l],A,n)) == set():
                return (n-m, A)

%timeit muR(10,1,3)

for i in [1..7]:
    print(muR(7,i,1))