Given a 1-indexed sorted-ascending array `numbers` and a `target`, return the 1-based indices [i, j] (i < j) of the two numbers that add up to target. Exactly one solution exists.