#include<bits/stdc++.h>
using namespace std;
const int mod=998344353;
char b[1000000001];
unsigned long long a,len;
unsigned long long QuickPow(unsigned long long n,unsigned long long p,unsigned long long mod)
{
	unsigned long long base=n,ans=1;
	while(p)
	{
		if(p%2!=0)ans=ans*base%mod;
		p>>=1;
		base=base*base%mod;
	}
	return ans%mod;
}
unsigned long long MOD()
{
	unsigned long long ans=0;
	for(unsigned long long i=1;i<=len;++i)	
	{
		ans*=10;
		ans+=(b[i]^'0');
		ans%=mod;
	}	
	return ans;
}
signed main()
{
	scanf("%s %lld",b+1,&a);
	len=strlen(b+1);
	unsigned long long b=MOD();
	unsigned long long k=QuickPow(2,a+2,mod)*b%mod;
	unsigned long long p=(k%mod+(25-k%25)%25)*4%mod;
	cout<<p;	
	return 0;
}