CF1313B.Different Rules

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Nikolay has only recently started in competitive programming, but already qualified to the finals of one prestigious olympiad. There going to be nn participants, one of whom is Nikolay. Like any good olympiad, it consists of two rounds. Tired of the traditional rules, in which the participant who solved the largest number of problems wins, the organizers came up with different rules.

Suppose in the first round participant A took xx -th place and in the second round — yy -th place. Then the total score of the participant A is sum x+yx + y . The overall place of the participant A is the number of participants (including A) having their total score less than or equal to the total score of A. Note, that some participants may end up having a common overall place. It is also important to note, that in both the first and the second round there were no two participants tying at a common place. In other words, for every ii from 11 to nn exactly one participant took ii -th place in first round and exactly one participant took ii -th place in second round.

Right after the end of the Olympiad, Nikolay was informed that he got xx -th place in first round and yy -th place in the second round. Nikolay doesn't know the results of other participants, yet he wonders what is the minimum and maximum place he can take, if we consider the most favorable and unfavorable outcome for him. Please help Nikolay to find the answer to this question.

输入格式

The first line contains an integer tt ( 1t1001 \le t \le 100 ) — the number of test cases to solve.

Each of the following tt lines contains integers nn , xx , yy ( 1n1091 \leq n \leq 10^9 , 1x,yn1 \le x, y \le n ) — the number of participants in the olympiad, the place that Nikolay took in the first round and the place that Nikolay took in the second round.

输出格式

Print two integers — the minimum and maximum possible overall place Nikolay could take.

输入输出样例

  • 输入#1

    1
    5 1 3

    输出#1

    1 3
  • 输入#2

    1
    6 3 4

    输出#2

    2 6

说明/提示

Explanation for the first example:

Suppose there were 5 participants A-E. Let's denote Nikolay as A. The the most favorable results for Nikolay could look as follows:

However, the results of the Olympiad could also look like this:

In the first case Nikolay would have taken first place, and in the second — third place.

首页