#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const ll mod = 1e9+7;


main(){
    ll a,b;cin>>a>>b;
    ll now = 2*a + 100;
    cout<<now-b;
}
/*

    I am the Best of The World
    
    Nafis_Cruciatus
   
*/

#include<bits/stdc++.h>
using namespace std;

/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    is;*/

#define fb find_by_order
#define ok order_of_key

typedef long long ll;
typedef int ii;

#define INF 10000000000000007
#define pi 3.141592654

#define T while(t--)
#define for2(i,a,b) for(i=a;i>=b;i--)
#define for3(i,a,b) for(i=a;i<=b;i=i+2)
#define for1(i,a,b) for(i=a;i<=b;i=i+1)

#define pb push_back
#define mp make_pair

#define ff first
#define ss second

#define si set<ll>
#define se multiset<ll>

typedef long double ld;
typedef vector<ll> vi;

#define all(v) sort(v.begin(),v.end())
#define all1(v) sort(v.rbegin(),v.rend())

#define pf(uuv) printf("%lld\n",uuv)

#define pf1(uu) printf("%.20Lf\n",uu)


ii main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t=1;
    //cin>>t;
    while(t--){
        ll a,b; cin>>a>>b;
        cout<<((2*a)+100)-b<<"\n";
        
    }
    
}