#include<bits/stdc++.h>
using namespace std;
#define test_case int t;cin>>t;while(t--)
const double pi=acos(-1.0);
void RAmadAN()
{
    /*
    cout<<fixed<<setprecision(2);
    itoa to convert any system itoa(n,bin,2)
    */

    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
long long gcd(long long a,long long b)
{
    return a ? gcd(b%a,a):b;
}
long long lcm(long long a,long long b)
{
    return a/gcd(a,b)*b;
}
int dx_r[]= {1, 0, -1, 0, -1, 1, -1, 1};
int dy_c[]= {0, 1, 0, -1, -1, 1, 1, -1};
int main()
{
    /*freopen("","r",stdin);
    freopen("","w",stdout);*/
    RAmadAN();
    int a,b;
    cin>>a>>b;
    cout<<(2*a+100)-b;
    return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque> 
#include <string>


using namespace std;


int main()
{
	int a, b;
	scanf("%d%d", &a, &b);
	int total = a * 2 + 100;
	int left = total - b;
	printf("%d\n", left);
	
	return 0;
}


