AMC 10B Fall 2021 (Problem 22)

Number TheoryHard
For each integer n≥2n\ge2, let SnS_n be the sum of all products jkjk, where jj and kk are integers and 1≤j<k≤n1\le j<k\le n. What is the sum of the 1010 least values of nn such that SnS_n is divisible by 33?
(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