#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int a, b, c;
    cin >> a >> b >> c;

    cout << 1LL * b - c + 1;

}

signed main()
{
    FIO
//    for(int c = 1; c <= 10; c++)
//    {
//        for(int b = c + 1; b <= 10; b++)
//        {
//            for(int a = b + 1; a <= 10; a++)
//            {
//                cout << a << ' ' << b << ' ' << c << ": ";
//                int x = (1 << a) + (1 << b) - (1 << c);
//                cout << __builtin_popcount(x) << ' ' << b - c + 1 << '\n';
//            }
//        }
//    }
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}