1
#include <bits/stdc++.h>
2
using namespace std;
3
const int N = 2e4 + 5;
4

5
struct Bigint
6
{
7
    int len, a[N];
8
    Bigint(string x = "0")
9
    {
10
        memset(a, 0, sizeof(a));
11
        int start = 0;
12
        while (start < (int)x.size() - 1 && x[start] == '0')
13
            start++;
14

15
        len = x.size() - start;
16
        for (int i = 0; i < len; i++)
17
        {
18
            a[i + 1] = x[x.size() - 1 - i] - '0';
19
        }
20
    }
21
    int &operator[](int i)
22
    {
23
        return a[i];
24
    }
25
    void flatten(int L)
26
    {
27
        len = L;
28
        for (int i = 1; i <= len; i++)
29
        {
30
            a[i + 1] += a[i] / 10;
31
            a[i] %= 10;
32
        }
33
        for (; !a[len];)
34
            len--;
35
    }
36
    void print()
37
    {
38
        for (int i = max(len, 1); i >= 1; i--)
39
        {
40
            cout << a[i];
41
        }
42
    }
43
};
44

45
bool operator>=(Bigint a, Bigint b)
46
{
47
    if (a.len != b.len)
48
        return a.len > b.len;
49
    for (int i = a.len; i >= 1; i--)
50
        if (a[i] != b[i])
51
            return a[i] > b[i];
52
    return true;
53
}
54

55
Bigint operator+(Bigint a, Bigint b)
56
{
57
    Bigint c;
58
    int len = max(a.len, b.len);
59
    for (int i = 1; i <= len; i++)
60
    {
61
        c[i] += a[i] + b[i];
62
    }
63
    c.flatten(len + 1);
64
    return c;
65
}
66
Bigint operator*(Bigint a, Bigint b)
67
{
68
    Bigint c;
69
    int lena = a.len, lenb = b.len;
70
    for (int i = 1; i <= lena; i++)
71
    {
72
        for (int j = 1; j <= lenb; j++)
73
        {
74
            c[i + j - 1] += a[i] * b[j];
75
        }
76
    }
77
    c.flatten(lena + lenb + 11);
78
    return c;
79
}
80

81
Bigint operator-(Bigint a, Bigint b)
82
{
83
    Bigint c;
84
    int len = a.len;
85
    for (int i = 1; i <= len; i++)
86
    {
87
        if (a[i] < b[i])
88
        {
89
            a[i] += 10;
90
            a[i + 1]--;
91
        }
92
        c[i] = a[i] - b[i];
93
    }
94
    c.flatten(len);
95
    return c;
96
}
97

98
Bigint operator/(Bigint a, Bigint b)
99
{
100
    Bigint rem = Bigint("0");
101
    string ans = "";
102
    for (int i = a.len; i >= 1; i--)
103
    {
104
        rem = rem * Bigint("10");
105
        rem[1] += a[i];
106
        rem.flatten(rem.len + 2);
107
        int cnt = 0;
108
        while (rem >= b)
109
        {
110
            rem = rem - b;
111
            cnt++;
112
        }
113
        ans += char(cnt + '0');
114
    }
115
    int start = 0;
116
    while (start < (int)ans.size() - 1 && ans[start] == '0')
117
        start++;
118
    return Bigint(ans.substr(start));
119
}
120

121
Bigint operator%(Bigint a, Bigint b)
122
{
123
    return a - ((a / b) * b);
124
}
125

126
int main()
127
{
128
    string a, b;
129
    cin >> a >> b;
130
    Bigint x(a), y(b);
131
    (x + y).print();
132
    cout << endl;
133

134
    if (x >= y)
135
    {
136
        (x - y).print();
137
    }
138
    else
139
    {
140
        cout << '-';
141
        (y - x).print();
142
    }
143
    cout << endl;
144

145
    (x * y).print();
146
    cout << endl;
147
    (x / y).print();
148
    cout << endl;
149
    (x % y).print();
150
    cout << endl;
151
    return 0;
152
}