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

#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define what_is(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair

using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using ull = unsigned long long ;
using pi = pair<int, int>;
using vl = vector<ll>;
using pl = pair<ll, ll>;
using msl = map<string, ll>;
using matrix = vector<vector<ll>>;

ll MOD = 1e9 + 7;
const int INF = int(1e9);

struct Rect {
	ll x1 = 0, y1 = 0, x2 = 0, y2 = 0;
	ll area() { return (x2 - x1) * (y2 - y1); }
};

Rect intersect(Rect p, Rect q) {
	Rect inter;
	inter.x1 = max(p.x1, q.x1);
	inter.y1 = max(p.y1, q.y1);
	inter.x2 = min(p.x2, q.x2);
	inter.y2 = min(p.y2, q.y2);
	if (inter.x1 >= inter.x2 || inter.y1 >= inter.y2) {
		Rect empty;
		return empty;
	}
	return inter;
}

bool iscovered(int x, int y, int x1, int y1, int x2, int y2) {
	return (x <= x2 && x >= x1 && y <= y2 && y >= y1);
}	

bool isPrime(int n) {
	if (n == 2) return true;
	for(int i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
} 

unsigned long long factorial(int n) {
    const unsigned int M = 1000000007;
    unsigned long long f = 1;
    for (int i = 1; i <= n; i++)
        f = (f*i) % M;  
    return f;
}


void solve() {
	int a, b;
	cin >> a >> b;
	int canfollow = 2 * a + 100;
	cout << canfollow - b;

	// int n;
	// cin >> n;
	// vi d(n);
	// REP(i, 0, n - 1) cin >> d[i];
	// d[0] = 0;
	// REP(i, 0, n - 1) {
	// 	if (d[i] > -1) {
	// 		int t = d[i];
	// 		int  j = 1;
	// 		while(t--) {
	// 			if (d[i - j] > - 1) {
	// 				cout << - 1;
	// 				return;
	// 			}
	// 			d[i - j] = t;
	// 			j++;
	// 		}
	// 	}
	// }
	// int m = 0, M = 0;
	// REP(i, 1, n - 1) {
	// 	if (d[i] > -1) m++;
	// 	else M++;
	// }
	// // cout << endl;
	// // REP(i, 0, n - 1) cout << d[i] << " ";
	// // cout << endl;

	// cout << m << " " << M + m;

}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("taming.in", "r", stdin);
	//freopen("taming.out", "w", stdout);
	//ll t; cin >> t;
	//while (t--)
		solve();
	return 0;
}

//A
#include<bits/stdc++.h>
#define MAX 200000
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	long long a,b;
	cin>>a>>b;
	cout<<2*a+100-b<<endl;
	return 0;
}