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
|
#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 ll long long
#define mid (x+y>>1)
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 100005
#define nm 131072
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;
}
ll n,ans;
int m,cnt,tot;
struct mat{ll a[211][211];}t;
bool v[1<<17];
vector<int>vec[211];
mat operator*(const mat&x,const mat&y){
mat s;mem(s.a);
inc(i,0,cnt)inc(k,0,cnt)inc(j,0,cnt)s.a[i][j]+=x.a[i][k]*y.a[k][j],s.a[i][j]%=inf;
return s;
}
mat qpow(mat x,ll t){
mat s=x;t--;
for(;t;t>>=1,x=x*x)if(t&1)s=s*x;
return s;
}
int main(){
n=read();m=read();tot=succ(m)-1;
vec[0].push_back(0);
inc(i,1,tot-1)if(!v[i] && (i & (i>>1|( (i&1)<<(m-1) ) ) )==0){
int t=i;
cnt++;
inc(j,1,m){
if(!v[t]){
v[t]++;
vec[cnt].push_back(t);
}
t=t>>1| ( (t&1)<<(m-1) );
}
}
inc(i,0,cnt)inc(j,0,cnt)for(auto&k:vec[j])if((vec[i][0]&k)==0)t.a[i][j]++;
t=qpow(t,n);
inc(i,0,cnt)ans+=t.a[0][i];
printf("%lld\n",ans%inf);
return 0;
}
|
