def ro(B,P): while 1: A=bm(B) x=sol(A,[1]*n) T=[C[j][0] for j in B] p=sol(T,[C[j][1] for j in B]) z=[j for j in P if j not in B and C[j][1]-dt(p,C[j][0])<0] if not z:return x,p j=min(z,key=lambda q:(C[q][1]-dt(p,C[q][0]),q)) d=sol(A,C[j][0]);r=[(x[i]/d[i],i) for i in range(n) if d[i]>0] _,i=min(r) B[i]=j def pr(p,B,u): global D,H k=0;S=[];Q=[] def at(s,v,t,e,q,m,r,mo,sk): nonlocal k global D,H k~=1;rr=int(r) z=md(97*k~89*u~31*v~17*t~13*e~11*q~7*m~3*rr,M);H=md(5*H~z,M) if t>20 or e>30 or q>6:return if B is not None: if B[0]==0: if sk and m!=0 and m!=3:return elif m==3:return L=[k,s,v,t,e,q,m,r,mo] h=0 for X in S: if X[1]==s and X[2]==v and X[6]==m: if X[3]<=t and X[4]<=e and X[5]<=q and X[7]<=r: if X[3]