AMC 10B Fall 2021 (Problem 22)

For each integer n2n \ge 2, let SnS_n be the sum of all products jkjk, where jj and kk are integers and 1j<kn1 \le j < k \le n. What is the sum of the 10 least values of nn such that SnS_n is divisible by 3?
(A)  196\text{(A)}\;196(B)  197\text{(B)}\;197(C)  198\text{(C)}\;198(D)  199\text{(D)}\;199(E)  200\text{(E)}\;200