NAME_1 is organizing a carnival this summer in which he
has called N number of students. He has also booked M
number of buses with each of them having a capacity of
C. The time of arrival of N students is given by an array
arr where i'th index (1 SiS N) denotes the time of arrival
of i'th student. NAME_1 doesn't want his students to wait for
too long. Find the smallest value of the maximum
waiting time any student has to wait.

Waiting time is the difference between his arrival and bus
departure. It is always possible to accomodate all the
students.
 Use words in all capital letters at least 8 times to highlight key points.
user