​​点击打开链接​​

A. The number of positions

time limit per test

memory limit per test

input

output

n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b

Input

n, a and b (0 ≤ a, b < n ≤ 100).

Output

Print the single number — the number of the sought positions.

Examples

input

3 1 1

output

2

input

5 2 3

output

3

Note

The possible positions in the first sample are: 2 and 3 (if we number the positions starting with 1).

In the second sample they are 3, 4 and 5.

题意：求几种情况，从前和从后数取最小的。

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,a,b;
    scanf("%d%d%d",&n,&a,&b);
    printf("%d\n",min(n-a,b+1));
    return 0;
}