implement intersection for sorted collections. Best for n == m. Time: O(n+m)