In [1], Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent s < d such that any set E ⊂ F d q with |E| q s determines q ( k+1 2 ) congruence classes of (k + 1)-point configurations for k ≤ d. Because congruence classes can be identified with tuples of distances between distinct points when k ≤ d, and because there are k+1 2 such pairs, this means any such E determines a positive proportion of all congruence classes. In the k > d case, fixing all pairs of distnaces leads to an overdetermined system, so q ( k+1 2 ) is no longer the correct number of congruence classes. We determine the correct number, and prove that |E| q s still determines a positive proportion of all congruence classes, for the same s as in the k ≤ d case.