include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

typedef long long ll;
using namespace std;

include [HTML_REMOVED]

include [HTML_REMOVED]

using namespace std;

const int N = 1000010;

bool cmp(vector[HTML_REMOVED] &A, vector[HTML_REMOVED] &B)
{
if (A.size() != B.size()) return A.size() >= B.size();
for (int i = A.size() - 1; i >= 0; i–)
if (A[i] != B[i])
return A[i] > B[i];
return true;
}

void trimZero(vector[HTML_REMOVED] &A)
{
while (A.back() == 0 && A.size() > 1) A.pop_back();
}

vector[HTML_REMOVED] sub(vector[HTML_REMOVED] &A, vector[HTML_REMOVED] &B)
{
vector[HTML_REMOVED] C;
int t = 0;
for (int i = 0; i < A.size(); i++)
{
t = A[i] - t;
if (i < B.size()) t -= B[i];
C.push_back((t + 10) % 10);
if (t < 0) t = 1;
else t = 0;
}
trimZero(C);

return C;

}

int main()
{
string a, b;
cin >> a >> b;
vector[HTML_REMOVED] A, B, C;
for (int i = a.size() - 1; i >= 0; i–) A.push_back(a[i] - ‘0’);
for (int i = b.size() - 1; i >= 0; i–) B.push_back(b[i] - ‘0’);

trimZero(A), trimZero(B);

if (cmp(A, B)) C = sub(A, B);
else {
    C = sub(B, A);
    printf("-");
}
for (int i = C.size() - 1; i >= 0; i--) cout << C[i];

return 0;

}