The problem is to find how many l*1 or 1*l while rectangles that do not *included* by each others.