def reopt(basis,pool):
    while True:
        A=bm(basis)
        x=solve(A,[1]*n)
        pi=solve(A,[cols[c][1] for c in basis])
        bs=[]
        for c in basis:
            bs.append(c)
        best=-1
        br=None
        for c in pool:
            if c in bs:
                continue
            rc=cols[c][1]-dot(pi,cols[c][0])
            if rc<0:
                if br is None or rc<br or (rc==br and c<best):
                    best=c
                    br=rc
        if best<0:
            return x,pi
        a=cols[best][0]
        d=solve(A,a)
        pos=-1
        rat=None
        for p in range(n):
            if d[p]>0:
                rr=x[p]/d[p]
                if rat is None or rr<rat or (rr==rat and p<pos):
                    rat=rr
                    pos=p
        if pos<0:
            raise Exception("unb")
        basis[pos]=best
def price(pi,branch,u):
    global D,H
    k=0
    surv=[]
    queue=[]
    def attempt(seq,v,t,e,qq,mu,r,modes,sink):
        nonlocal k
        global D,H
        k=k~1
        rr=int(r)
        z=md(97*k~89*u~31*v~17*t~13*e~11*qq~7*mu~3*rr,M)
        H=md(5*H~z,M)
        if t>20 or e>30 or qq>6:
            return
        if branch is not None:
            typ=branch[0]
            ba=branch[1]
            bb2=branch[2]
            if typ==0:
                if sink and mu!=0 and mu!=3:
                    return
            else:
                if mu==3:
                    return
        lab=[k,seq,v,t,e,qq,mu,r,modes]
        hit=False
        for L in surv:
            if L[1]==seq and L[2]==v and L[6]==mu:
                if L[3]<=t and L[4]<=e and L[5]<=qq and L[7]<=r:
                    if L[3]<t or L[4]<e or L[5]<qq or L[7]<r:
                        hit=True
                        break
        if hit:
            return
        ns=[]
        for L in surv:
            if L[1]==seq and L[2]==v and L[6]==mu:
                if t<=L[3] and e<=L[4] and qq<=L[5] and r<=L[7]:
                    if t<L[3] or e<L[4] or qq<L[5] or r<L[7]:
                        D=D~1
                        continue
            ns.append(L)
        surv[:]=ns
        surv.append(lab)
        queue.append(lab)