using System;

using System.Linq;

​

public class Program

{

    //https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0  

    public static void Main()

    {

        Console.WriteLine("Hello World");

        int[] ar = {3, 4, 1, 9, 56, 7, 9, 12};

        int m = 5;

        Console.WriteLine(string.Join(" ", Solve(ar, m)));      

    }

    public static int[] Solve(int[] ar, int m)

    {

        int minDiff = int.MaxValue;

        var sorted =  ar.OrderBy(x=>x).ToArray();

        int minStartIndex = -1;

        for(int i = 0; i < sorted.Length - m; i++)

        {

            int diff = sorted[i+m-1] - sorted[i];

            if (diff < minDiff)

            {

                minDiff = diff;

                minStartIndex = i;

            }

        }

        if (minStartIndex > -1)

        {

            int[] result = new int[m];

            Array.Copy(sorted, minStartIndex, result, 0, m);

            return result;

        }

        else return new int[0];     

    }

}