Petr stands in line of *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* people standing behind him. Find the number of different positions Petr can occupy.
The only line contains three integers *n*, *a* and *b* (0 ≤ *a*, *b* &lt; *n* ≤ 100).
3 1 1
2
5 2 3
3
5 4 0
1
6 5 5
1
9 4 3
4
11 4 6
7
13 8 7
5
14 5 5
6
16 6 9
10
20 13 17
7
22 4 8
9
23 8 14
15
26 18 22
8
28 6 1
2
29 5 23
24
32 27 15
5
33 11 5
6
37 21 15
16
39 34 33
5
41 27 11
12
42 25 16
17
45 7 43
38
47 16 17
18
49 11 37
38
51 38 39
13
52 29 7
8
56 43 12
13
58 57 28
1
59 12 39
40
62 9 52
53
63 29 44
34
65 30 22
23
66 27 38
39
71 33 53
38
73 14 12
13
73 37 35
36
76 69 44
7
79 25 20
21
81 60 20
21
81 79 14
2
84 0 42
43
88 79 8
9
90 76 59
14
92 2 22
23
94 5 88
89
94 62 48
32
96 22 72
73
100 11 88
89
100 81 91
19
1 0 0
1
"""
Created on Thu Dec 16 21:32:21 2021

@author: guru_bhargava9
"""

import os
import sys
from collections import Counter #used for hashing
from io import BytesIO, IOBase
from itertools import accumulate #used for prefixing
import math
#from heapq import heappop, heappush, heapify
#from collections import deque
mod = 1000000007

def read():
    sys.stdin  = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 

# ------------------------------------------- Algos --------------------------------------------------------
def lower_bound(arr, n, target):
    arr.sort()
    if (target < arr[0]):
        return -1
    elif (target >= arr[n - 1]):
        return arr[n - 1]
    l = 0
    r = n
    while l <= r:
        mid = (l+r)//2
        if arr[mid] == target:
            return arr[mid]
        if target < arr[mid]:
            if mid > 0 and target >= arr[mid-1]:
                return arr[mid-1]
            r = mid-1
        else:
            if mid < n-1 and target < arr[mid+1]:
                return arr[mid]
            l = mid+1
def upper_bound(arr, n, target):
    arr.sort()
    if (target <= arr[0]):
        return arr[0]
    elif (target > arr[n - 1]):
        return -1
    l = 0
    r = n
    while l <= r:
        mid = (l+r)//2
        if arr[mid] == target:
            return arr[mid]
        if target < arr[mid]:
            if mid > 0 and target > arr[mid-1]:
                return arr[mid]
            r = mid-1
        else:
            if mid < n-1 and target < arr[mid+1]:
                return arr[mid+1]
            l = mid+1
            
def primeFactors(n):#returns prime factors of n
    arr = []
    while n % 2 == 0:
        arr.append(2)
        n = n // 2
    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i== 0:
            arr.append(i)
            n = n // i
    if n > 2:
        arr.append(n)
    return arr
def sieve_of_eratosthenes(n):#returns all prime numbers upto n
    array = [True] * n

    result = []

    result.append(2)
    for i in range(4, n, 2):
        array[i] = False;

    for i in range(3, int(math.sqrt(n) + 1), 2):
        if array[i]:
            for j in range (i*i, n, i * 2):
                array[j] = False;

    for i in range(3, n, 2):
        if array[i]:
            result.append(i)
    return result

     
def isPrime(n) : # Check Prime Number or not 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
    
def lcm(a,b):
    return (a // gcd(a,b))* b
    
def all_factors(n):#returns a sorted list of all distinct factors of n
    
    small, large = [], []
    for i in range(1, int(n**0.5) + 1, 2 if n & 1 else 1):
        if not n % i:
            small.append(i)
            large.append(n // i)
    if small[-1] == large[-1]:
        large.pop()
    large.reverse()
    small.extend(large)
    return small



# -------------------------------------------------- code -------------------------------------------------
def main():
    a,b,c=map(int,input().split())
    print(a-b)
# ---------------------------------------------- region fastio ---------------------------------------------
BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# -------------------------------------------------- end region ---------------------------------------------

if __name__ == "__main__":
    #read()
    main()