The elements that d is between in row one relatively reliably give the correct i value for c (nontrivial). Previously, it took 4 element calculations to check these, but with parity matching, it can be found in 2 calculations.

With the addition of the elements that c is between in i[t], the solution i is also given by j[t] relatively reliably, and it works on examples that fail the original SeeIt calculation.