#include<iostream>
#include<math.h>
using namespace std;
string a, b;
int A[500000]={0}, B[500000] = {0}, C[500000] = {0};
int main()
{
	cin >> a >> b;
	bool f = false;
	int lena = a.length();
	int lenb = b.length();
	for (int i = 0; i < lena; i++)
		A[i] = a[lena - i - 1] - '0';
	for (int i = 0; i < lenb; i++)
		B[i] = b[lenb - i - 1] - '0';
	if (lena < lenb || lena == lenb && a < b)
	{
		f = true;
		swap(A, B);
	}
	int lenc= max(lena, lenb);
	for (int i = 0; i < lenc; i++)
	{
		if (A[i] - B[i] >=0)
		{
			C[i] = A[i] - B[i];

		}
		else
		{
			A[i + 1] -= 1;
			C[i] = A[i] - B[i] + 10;
			
		}
		/*if (A[i] < B[i])
		{
			A[i + 1]--;
			A[i] += 10;
		}
		C[i] = A[i] - B[i];*/
	}
	if (f)cout << "-";
	while (C[lenc-1] == 0 && lenc > 2)
		lenc--;
	for (int i = lenc - 1; i >= 0; i--)
		cout << C[i];
	return 0;
}