choosa = sum(M(1:choose, :));
choosb = sum(M(choose+1:2*choose, :));
thisc = choosa;
thatc = choosb;
right = 0;
wrong = 0;
for x = 1:choose
	for n = 1:nclust
		if(M(x,n) == 1)
			if(thisc(n) > thatc(n))
				right = right+1;
			else
				wrong = wrong+1;
			end
		end
	end
end
for x = choose+1:2*choose
	for n = 1:nclust
		if(M(x,n) == 1)
			if(thatc(n) > thisc(n))
				right = right+1;
			else
				wrong = wrong+1;
			end
		end
	end
end
wrong/(right+wrong)
