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

    #define ll long long
    #define endl '\n'
    using namespace std;
    using namespace __gnu_pbds;

    template<typename T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
    const int N = 1e5+7, P1 = 31, P2 = 37, mod= 1e9 + 7;

    void doWork() {
      int a,b,c;
      cin >> a >> b >> c;
      cout << 1+b-c << endl;
    }


    int main() {
        ios::sync_with_stdio(false);
        cout.tie(nullptr);
        cin.tie(nullptr);
    //    freopen("bisector.in","r",stdin);
    //    freopen("bisector.out","w",stdout);
        int t = 1;
        // cout << primes.size() << endl;
        //cin >> t;
        while (t--) {
            doWork();
        }
        return 0;
    }