#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
int Max(int x, int y);
string s1, s2;
int s[520];
int i,j;
int main ()
{
cin >> s1 >> s2;
memset(s,0,sizeof(s));
int lena=s1.length();
int lenb=s2.length();
int len=Max(lena,lenb)+5;
reverse(s1.begin(),s1.end());//把s1,s2反一下,从个位开始读数
reverse(s2.begin(),s2.end());
int t=0, sum=0, a=0, b=0;
for(i=0; i<len; i++)//每一位的数值
{
if(lena>i)
a=s1[i]-'0'-t;
else
a=0;
if(lenb>i)
b=s2[i]-'0';
else
b=0;
if((a-b)<0)//分类讨论
{
sum=a-b+10;
t=1;
}
else
{
sum=a-b;
t=0;
}
s[i]=sum;
}
for(j=len-1;j>-1&&!s[j]; j--)
;
for(; j>-1; j--)
cout << s[j];
cout << endl;
}
int Max(int x, int y)//返回最大值
{
return x>y? x : y;
}