#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
using namespace std;


#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


int main() {
	string a, b;
	cin >> a >> b;
	if (b[0] == '-') {
		ll x, y;
		x = atoll(a.c_str());
		y = atoll(a.c_str());
		cout << x - y << endl;
	}
	else {
		string s = a + b;
		string ans;
		bool ok = false;
		REP(i, s.size()) {
			if (s[i] != '-' and s[i] != '0')ok = true;
			if (!ok and s[i] == '0')continue;
			ans.push_back(s[i]);
		}
		if (ans == "-" or ans == "")cout << '0' << endl;
		else cout << ans << endl;
	}
}