Let S={x1,x2,…,xk+ℓ} be a (k+ℓ)-element set of real numbers contained in the interval [0,1];k and ℓ are positive integers. A k-element subset A⊂S is called nice if k1xi∈A∑xi−ℓ1xj∈S\A∑xj≤2kℓk+ℓ. Prove that the number of nice subsets is at least k+ℓ2(k+ℓk).