using java without using Arraylist write methode that takes M as input ,S,N the function should find the smallest numbers on array

Example if S={16,90,179,10,33,7,89,2139, 37,17,439,105,9} n=13 then

The smallest m numbers when m=1 is {7}

The smallest m numbers when m=2 is {7,9}

The smallest m numbers when m=3 is {7,9,10}

Consider the case where the numbers in S are not necessarily all of them are distinct, for example,

if S={53, 8, 17, 8, 90, 5, 18, 17, 663, 91} n=10, then

The smallest m numbers when m=1 is {5}

The smallest m numbers when m=2 is {5,8}

The smallest m numbers when m=3 is {5,8,17} not {5,8,8}