Problem:
Score : 100 points

Problem Statement

We conducted a survey on newspaper subscriptions.
More specifically, we asked each of the N respondents the following two questions:

Question 1: Are you subscribing to Newspaper X?

Question 2: Are you subscribing to Newspaper Y?

As the result, A respondents answered "yes" to Question 1, and B respondents answered "yes" to Question 2.

What are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?

Write a program to answer this question.

Constraints

1 \leq N \leq 100

0 \leq A \leq N

0 \leq B \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.

Sample Input 1

10 3 5

Sample Output 1

3 0

In this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.

Here, the number of respondents subscribing to both newspapers is at most 3 and at least 0.

Sample Input 2

10 7 5

Sample Output 2

5 2

In this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.

Here, the number of respondents subscribing to both newspapers is at most 5 and at least 2.

Sample Input 3

100 100 100

Sample Output 3

100 100

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

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main{
	
    public static void main(String[] args) {
        Scanner sc = new Scanner (System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        long[] b = new long[n];
        long [] ss = new long[n];
        for(int i=0;i<n;i++) {
        	a[i] = sc.nextLong();
        	b[i] = sc.nextLong();
        	ss[i] = a[i] + b[i];
        }
        
        long t = 0;
        long o = 0;
        
        HashMap<Long, Integer> s = new HashMap<>();
        for(int i=0;i<n;i++) {
        	s.put(ss[i], i);
        }
        Arrays.sort(ss);
        
        for(int i=n-1;i>=0;i--) {
        	int j = s.get(ss[i]);
        	if(((n-1)-i)%2 == 0) {
        		t += a[j];
        	}else {
        		o += b[j];
        	}
        }
        System.out.println(t - o);
    }
}