We have A={n∈N:n is a 3-digit number}={100,101,…,999}, B={9k+2:k∈N}, and C={9k+l:k∈N} where 0<l<9.
The set B consists of all natural numbers that leave remainder 2 when divided by 9. Similarly, C consists of all natural numbers that leave remainder l when divided by 9.
The 3-digit numbers with remainder r modulo 9 (for 1≤r≤8) form an arithmetic progression with first term 99+r, last term 990+r, and common difference 9. The number of such terms is 9(990+r)−(99+r)+1=100.
The sum of the 3-digit numbers with remainder r is 2100×(99+r+990+r)=50(1089+2r).
For B, the remainder is r=2, so the sum of 3-digit numbers in B is 50(1089+4)=50×1093=54650.
If l=2, then B and C pick out different residue classes, and A∩(B∪C) is the union of two disjoint sets. The total sum is 54650+50(1089+2l).
We are given that this sum equals 274×400=109600. So 54650+50(1089+2l)=109600.
Simplifying, 54650+54450+100l=109600, which gives 109100+100l=109600, so 100l=500 and l=5.
Hence, the answer is 5.