#include <bits/stdc++.h>

#define F first
#define S second
#define ld long double
#define EPS 1e-9
using namespace std;

typedef long long ll;
const int N = 10000;
int a[N];
int main ()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout.tie(0);
	//freopen("wigz.in","r",stdin);
	/*int n;
	cin >> n;
	for(int i = 1; i <= n ;++i) a[i] = i;
	do{
        int ok = 1;
        for(int i = 2; i <= n ;++i){
            int mn = min(a[i],a[i-1]);
            int mx = max(a[i],a[i-1]);
            ok &= (mx%mn == 0);
        }
        if(ok)
        {
            for(int i = 1; i <= n ;++i) cout << a[i] << ' ';
            cout << "\ntmm";
            return 0;
        }
	}while(next_permutation(a+1,a+n+1));
	if(n == 1) cout << 1 ;
	else if(n == 2) cout << "1 2";
	else if(n == 3) cout << "3 1 2";
	else if(n == 4) cout << "3 1 2 4";
	else if(n == 6) cout << "5 1 4 2 6 3";
	else cout << -1;
        */
    int a,b,c;
    cin >> a >> b >> c;
    cout << b - c + 1;
	return(0);
}