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 Java7 (OpenJDK 1.7.0) (judge verdict: Runtime Error)

import java.util.ArrayList;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		ArrayList<Integer>a=new ArrayList<Integer>();
		ArrayList<Integer>b=new ArrayList<Integer>();
		for(int i = 0; i < n; i ++) {
			a.add(sc.nextInt());
			b.add(sc.nextInt());
		}
		sc.close();
		long r = 0;
		int max, index;
		boolean teban = true;
		for(int i = 0; i < n; i ++) {
			max = a.get(0) + b.get(0);
			index = 0;
			for(int j = 0; j < a.size(); j ++) {
				if(a.get(j) + b.get(j) >= max) {
					if(a.get(j) >= a.get(index)) {
						max = a.get(j) - b.get(j);
						index = j;
					}
				}
			}
			if(teban) {
				r += a.get(index);
			}else {
				r -= b.get(index);
			}
			a.remove(index);
			b.remove(index);
			teban = !teban;
		}
		System.out.println(r);
	}
}