implement intersection algoritm for sortered collections. For n << m case. Time: O(n*log(m))