B and C will contain three digit numbers of the form 9k+2 and 9k+l respectively. We need to find sum of all elements in the set B∪C effectively.
Now, S(B∪C)=S(B)+S(C)−S(B∩C) where S(k) denotes sum of elements of set k.
Also, B=101,110,……,992
∴S(B)=2100(101+992)=54650
Case-I: If l=2
then B∩C=B
∴S(B∪C)=S(B)
which is not possible as given sum is
274×400=109600.
Case-II If l=2
then B∩C=ϕ
∴S(B∪C)=S(B)+S(C)=400×274
⇒54650+k=1∑1109k+l=109600
⇒9k=11∑110k+k=11∑110l=54950
⇒9(2100(11+110))+l(100)=54950
⇒54450+100l=54950
⇒l=5