Two sum with the lexicographically smallest index pair

Given an integer array and a target, return a pair of indices i < j whose values add up to the target. When several pairs work, return the lexicographically smallest one (smallest i, then smallest j). Do it in one pass with a hash map.