1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define mid ((x+y)/2)
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 530005
#define nm 400005
using namespace std;
const double pi=acos(-1);
const ll inf=998244353;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,cnt,tot;
int c[NM],b[NM];
ll a[NM],m;
char _s[NM];
ll qpow(ll x,ll t){return t?qpow(sqr(x)%inf,t>>1)*(t&1?x:1ll)%inf:1ll;}
void fwt(ll*a,int f){
if(f==-1)f=inf+1>>1;
for(int k=1;k<n;k<<=1)
for(int i=0;i<n;i+=k<<1)
for(int j=0;j<k;j++){
ll x=a[i+j],y=a[i+j+k];
a[i+j]=f*(x+y)%inf;
a[i+j+k]=f*(x-y+inf)%inf;
}
}
int main(){
scanf("%s",_s+1);m=read();
tot=strlen(_s+1);
dec(i,tot,1){
int t=0;
dec(j,7,0)
if(i-j>0)t=t*10+_s[i-j]-'0';
i-=7;
c[++cnt]=t;
}
tot=0;
while(cnt){
b[tot++]=c[1]&1;
dec(i,cnt,1){
if(c[i]&1)if(i>1)c[i-1]+=100000000;
c[i]>>=1;
}
while(!c[cnt]&&cnt>0)cnt--;
}
int t=0;
dec(i,tot-1,0){
a[i]=(t+b[i])%inf;
t=t<<1;t+=b[i];t%=inf;
}
for(n=1;n<tot;n<<=1);
fwt(a,1);
inc(i,0,n-1)a[i]=qpow(a[i],m);
fwt(a,-1);
ll ans=0;
inc(i,1,n-1)ans+=a[i],ans%=inf;
return 0*printf("%lld\n",ans);
}
|
