Question: How do you efficiently generate a list of K non-repeating integers between 0 and an upper bound N