#include #include #include #include using namespace std; using namespace __gnu_pbds; template using ordered_set = tree, rb_tree_tag, tree_order_statistics_node_update>; struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<=0;i--) #define FOR(i,a,b) for(ll i=a;i<=ll(b);i++) #define FORD(i,a,b) for(ll i=a;i>=ll(b);i--) #define overload4(_1,_2,_3,_4,name,...) name #define overload3(_1,_2,_3,name,...) name #define rep1(n) for(ll i=0;i(a);) #define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c) #define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__) #define ALL(v) v.begin(), v.end() #define endl "\n" #define fi first #define se second #define popcount(bit) __builtin_popcount(bit) #define popcountll(bit) __builtin_popcountll(bit) #define pb push_back #define eb emplace_back #define sz(x) ((ll)(x).size()) using namespace atcoder; using P = pair; using PL = pair; using Graph = vector>; typedef long long ll; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; } inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; } inline void OKNG(bool b = true) { cout << (b ? "OK" : "NG") << '\n'; } const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; const int fx[8] = {0, 1, 1, 1, 0, -1, -1, -1}; const int fy[8] = {1, 1, 0, -1, -1, -1, 0, 1}; template const auto INF = numeric_limits::max()/2; int main() { string a, b; cin >> a >> b; reverse(ALL(a)); reverse(ALL(b)); vector ans(max(a.size(), b.size() + 1)); int i = 0; int j = 0; while(i < a.size() && j < b.size()){ int c = a[i] - '0'; int d = b[i] - '0'; ans[i] += c + d; ans[i+1] += ans[i] / 10; ans[i] %= 10; i++; j++; } while(i < a.size()){ int c = a[i] - '0'; ans[i] += c; ans[i+1] += ans[i] / 10; ans[i] %= 10; i++; } while(j < b.size()){ int c = b[j] - '0'; ans[j] += c; ans[j+1] += ans[j] / 10; ans[j] %= 10; j++; } if(ans.back() == 0)ans.pop_back(); reverse(ALL(ans)); for(auto &d: ans)cout << d; cout << endl; }