Problem:
Score : 100 points

Problem Statement

Dolphin loves programming contests. Today, he will take part in a contest in AtCoder.

In this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as "21 o'clock".

The current time is A o'clock, and a contest will begin in exactly B hours.
When will the contest begin? Answer in 24-hour time.

Constraints

0 \leq A,B \leq 23

A and B are integers.

Input

The input is given from Standard Input in the following format:

A B

Output

Print the hour of the starting time of the contest in 24-hour time.

Sample Input 1

9 12

Sample Output 1

21

In this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.

Sample Input 2

19 0

Sample Output 2

19

The contest has just started.

Sample Input 3

23 2

Sample Output 3

1

The contest will begin at 1 o'clock the next day.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A = sc.nextInt();
		int B = sc.nextInt();
		Long[] vList = new Long[N];
		for(int i=0; i<N; i++){
			vList[i] = sc.nextLong();
		}
		sc.close();
		
		Arrays.sort(vList, Comparator.reverseOrder());
		
		double sum = 0;
		for(int i=0; i<A; i++){
			sum += vList[i];
		}
		double avg =  sum/(double)A;
	
		long cNum = 0;
		
		if(vList[0]==vList[A-1]){
			for(int i=A; i<=B; i++){
				int count=0;
				for(long v: vList){
					if(v==vList[0]) count++;
				}
				cNum += comb(count,i);
			}
		}else{
			int count=0;
			int countL=0;
			for(long v: vList){
				if(v==vList[A-1]) count++;
				if(v>vList[A-1]) countL++;
			}
			cNum += comb(count, A-countL);
		}

		
		System.out.println(avg);
		System.out.println(cNum);
	}
	
	public static final long comb(int n, int r) {
	    if (r == 1) {
	        return n;
	    }
	    long sum = 1;
	    for (int i = 1; i <= r; i++) {
	    	sum = sum * (n - i + 1) / i;
	    }
	    return sum;
	}

}