For each integer n≥2, let Sn be the sum of all products jk, where j and k are integers and 1≤j<k≤n. What is the sum of the 10 least values of n such that Sn is divisible by 3?
<spanclass=′latex−bold′>(A)</span>196<spanclass=′latex−bold′>(B)</span>197<spanclass=′latex−bold′>(C)</span>198<spanclass=′latex−bold′>(D)</span>199<spanclass=′latex−bold′>(E)</span>200