#include<iostream>
#include<algorithm>
#include<cmath>
#include<stack>
#include<string>
#include<cstring>
#include<queue>
#include<map>
#include<iomanip>

using namespace std;
int arr[505],brr[505],crr[505];
int main(){
	string s,s1;
	cin>>s>>s1;
	int len = max(s.size(),s1.size())-1;
	for(int i=0;i<=len;i++){
		arr[i] = s[i]-'0';
		brr[i] = s1[i] - '0';
	}
	int c = 0;
	for(int i=len;i>=0;i--){
		if(arr[i]+brr[i]+c<=9){
			crr[i] = arr[i]+brr[i]+c;
		}else{
			crr[i] = (arr[i]+brr[i]+c)%10;
		}
		c = (arr[i]+brr[i]+c)/10;
		cout<<c<<' ';
	}
	if(c!=0){
		cout<<c;
		for(int i=0;i<=len;i++){
			cout<<crr[i];
		}
	}else{
		for(int i=0;i<=len;i++){
			cout<<crr[i];
		}
	}
	return 0;
}