Codeforces Round 461- Problem F

For some set of integers I, define f(I) as the number of pairs a,b in I such that a) a is strictly less than b b) a divides b without a remainder. Write an algorithm to find a subset I of {1,2,⋯,n} such that f(I)=k given the value of n and k