#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
void Find(string &A, int k, int &c);
bool IsPnum(string A);
string ADD(string A);
int main()
{
string A, B;
int k, c;
cin >> A >> k;
c = 0;
Find(A, k, c);
cout << A << endl << c << endl;
system("pause");
return 0;
}
void Find(string &A, int k, int &c)
{
if (c == k||IsPnum(A))
return;
A = ADD(A);
c++;
Find(A, k, c);
}
string ADD(string A)
{
string B = A;
reverse(B.begin(), B.end());
//cout << "reverse:" << B << endl;
int l = A.length();
int i = l - 1;
int flag = 0;
while (i >= 0)
{
flag += A[i] + B[i] - '0' * 2;
A[i] = flag % 10 + '0';
flag /= 10;
i--;
}
if (flag)
A = "1" + A;
return A;
}
bool IsPnum(string A)
{
int l = A.length();
int i = 0;
while (i < l / 2)
{
if (A[i] != A[l - 1 - i])
return false;
i++;
}
return true;
}