Let A be a set of nonnegative integers. (hA) (t) the all integers in sumset hA that have at least t representations as sum h elements A. In this paper, we prove that, if k≥2, and A=a 0 ,a 1 ,⋯,a k is finite such 0=a <a <⋯<a gcda 2 =1, then there exist c ,d sets C ⊆[0,c -2], D ⊆[0,d -2]