/*
TASK:future
LANG:C++
*/
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int sr[10],n[256],m[256],p[256],c,a,b,d,i,j,k,l,pg=0;
void sum()
{
     if (k<l)
     {
     for (i=l;i>=k;i--)
         n[i]=n[i-l+k];
     for (i=1;i<=l-k;i++)
         n[i]=0;
     k=l;
     }
     if (k>l)
     {
     for (i=k;i>=l;i--)
         m[i]=m[i+l-k];
     for (i=1;i<=k-l;i++)
         m[i]=0;
     }
     int pr=0;
     for (i=1;i<=k;i++)
         if (n[i]!=m[i]) {pg=1;break;}
     if (pg==1)
     {
     for (i=k;i>=1;i--)
         {
         p[i]=(abs(n[i]-m[i]))%10+pr;
         pr=(abs(n[i]-m[i]))/10;
         if (i==1) p[0]=pr;
         }
     }
     return;
}
void solve()
{
     sum();
     if (pg==0) return;
     int pr=0;
     for (i=0;i<=k;i++)
         n[i+2]=p[i];
     for (i=0;i<=k;i++)
         m[i+1]=p[i];
     a=c%10;
     b=c/10;
     for (i=k+2;i>=1;i--)
     {
     n[i]=(n[i]*a)%10+pr;
     pr=(a*n[i])/10;
     if (i==2) n[1]=pr;
     }
     n[0]=0;
     pr=0;
     for (i=k+1;i>=1;i--)
     {
     m[i]=(m[i]*b)%10+pr;
     pr=(b*m[i])/10;
     if (i==1) m[0]=pr;
     }
     m[k+2]=0;
     k=k+2;
     l=k;
     sum();    
     return;
}
string s1,s2;
int main()
{
cin>>s1;
cin>>s2;
cin>>c;
for (i=0;i<=9;i++)
    sr[i]=0;
k=s1.length();
l=s2.length();
for (i=1;i<=k;i++)
n[i]=s1[i-1]-'0';
for (i=1;i<=l;i++)
m[i]=s2[i-1]-'0';
solve();
int p1;
if (pg==0) cout<<"0\n0\n";
else
{
for (p1=0;p1<=k;p1++)
    if (p[p1]!=0) break;
for(i=p1;i<=k;i++)
cout<<p[i];
cout<<endl;
int ss=0;
for (i=p1;i<=k;i++)
ss=ss+p[i];
for (i=p1;i<=k;i++)
sr[p[i]]++;
int max=0;
for (i=1;i<=9;i++)
if (sr[i]>=sr[max]&&(ss%sr[i])==0) max=i;
cout<<sr[max]<<endl;
}
return 0;
}
