//In the name of 2002!
#include<iostream>
#include<deque>
using namespace std;
#define bignum deque<int>
int const MOD=10;
void output(bignum x){
      int j=0;
      while(!x[j]){
            x.pop_front();
      }
      if(x.size()==0)
            cout<<"0";
      for(int i=0;i<x.size();i++)
            cout<<x[i];
      cout<<endl;
}

bignum make_num(string x){
      int i=0;
      bignum ans;
      while(i<x.size()){
            ans.push_back(x[i]-'0');
            i++;
      }
      return ans;
}
void dah_bar_yek(bignum &num){
      for(int i=num.size();i>0;i--){
            num[i-1]+=num[i]/MOD;
            num[i]%=MOD;
      }
      while(num.size()>0 and num[0]/MOD>0){ 
            num.push_front(num[0]/MOD);
            num[1]%=MOD;
      }
}
bignum operator +(bignum x,bignum y){
	while(x.size()< y.size())
	      x.push_front(0);
	while(y.size()<x.size())
	   	y.push_front(0);
      for(int i=0;i<x.size();i++){
x[i]+=y[i];
      }
      dah_bar_yek(x);
      return x;
}
bignum zarb_s(bignum x,int y){
      for(int i=0;i<x.size();i++){
            x[i]*=y;
            }
	dah_bar_yek(x);
      return x;              
}
bignum operator *(bignum x,bignum y){
      bignum num;
      num.push_back(0);
      for(int i=0;i<y.size();i++){
            num.push_back(0);           
            num=num+zarb_s(x,y[i]);
      }
      dah_bar_yek(num);
      return num;
}
bignum nesf(bignum x){
      for(int i=0;i<x.size();i++){
        if(x[i]%2==1 and i!=x.size()-1)
		x[i+1]+=10;
	x[i]/=2;
      }
	while(x.size()!=0 and x[0]==0)
		x.pop_front();
      return x;
}
bignum operator ^(bignum &x,bignum y){
      if(y.size()==0)
	{
	bignum ans;
	ans.push_back(1);
	return ans;
	}
      bignum num=x^(nesf(y));
      num=num*num;
      if(y[y.size()-1]%2)
            num=(num*x);
      return num;
}
int main(){
      string s;
      string t;
      cin>>s;
      cin>>t;
      bignum a=make_num(s);
      bignum b=make_num(t);
      bignum sum_num=(a+b);
      output(sum_num);
      bignum mult_num=(a*b);
      output(mult_num);
      bignum tavan_num=(a^b);
      output(tavan_num);
      return 0;
}