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 JavaScript (node.js v5.12) (judge verdict: Runtime Error)

	function Main(input){
		var input = input.split(/\r\n|\r|\n/);
    	var n = parseInt(input[0],10);
    	var a = input[1].split("");
    	var b = input[2].split("");
    	var c = input[3].split("");
    	var point = new Array(3);
    	var cnt = 0;
    	console.log('%d %s',a[0],b[0],c[0]);
    	while (cnt == n) {
    		if (a[cnt] == b[cnt]){point[0]++;}
    		cnt++; 
		}
		cnt = 0;
		while (cnt == n) {
    		if (a[cnt] == c[cnt]){point[1]++;}
    		cnt++; 
		}
		cnt = 0;
		while (cnt == n) {
    		if (b[cnt] == c[cnt]){point[2]++;}
    		cnt++; 
		}
		point.sort();
		ans = point[0]+point[1];
		    	console.log('%d %s',ans);
		}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));