#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5+5;
int a[N],b[N];
int c[N];
int n,m;
string s1,s2;
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>s1>>s2;
int n=s1.length();
int m=s2.length();
for(int i=1;i<=n;i++){
a[n-i+1]+=s1[i-1]-'0';
}
for(int i=1;i<=m;i++){
b[m-i+1]+=s2[i-1]-'0';
}
int jw=0;
for(int i=1;i<=max(n,m);i++){
c[i]=a[i]+b[i]+jw;
jw=c[i]/10;
c[i]%=10;
}
if(jw){
c[max(n,m)+1]=jw;
}
int k=max(n,m)+1;
while(c[k]==0)k--;
for(int i=k;i>=1;i--){
cout<<c[i];
}
return 0;
}
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5+5;
int a[N],b[N],c[N];
string s1,s2;
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>s1>>s2;
int n=s1.length();
int m=s2.length();
for(int i=1;i<=n;i++){
a[n-i+1]=s1[i-1]-'0';
}
for(int i=1;i<=m;i++){
b[m-i+1]=s2[i-1]-'0';
}
int jw=0;
for(int i=1;i<=n;i++){
jw=0;
for(int j=1;j<=m;j++){
c[i+j-1]+=a[i]*b[j]+jw;
jw=c[i+j-1]/10;
c[i+j-1]%=10;
}
c[i+m]+=jw;
}
int k=n+m+1;
while(c[k]==0&&k>1)k--;
for(int i=k;i>=1;i--){
cout<<c[i];
}
return 0;
}
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5+5;
int a[N],c[N];
string s1;
int b;
signed main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>s1>>b;
int n=s1.length();
for(int i=1;i<=n;i++){
a[i]=s1[i-1]-'0';
}
int x=0;
for(int i=1;i<=n;i++){
c[i]=(x*10+a[i])/b;
x=(x*10+a[i])%b;
}
int sb=1;
while(c[sb]==0&&sb<n){
sb++;
}
for(int i=sb;i<=n;i++){
cout<<c[i];
}
cout<<"\n";
cout<<x;
return 0;
}