1 #include<iostream>
 2 using namespace std;
 3 long long n,k,t[100001];
 4 long long f[10][100001][101];
 5 long long sta[100001],king[100001],ans;
 6 void inte()
 7 {
 8     int tot=(1<<n)-1; 
 9     for(int i=0;i<=tot;i++)
10         if(!((i<<1)&i))       
11         {
12             sta[++ans]=i;  
13             int t=i;
14             while(t)            
15             {
16                 king[ans]+=t%2;
17                 t>>=1;    
18             }
19         }
20 } 
21 int main ()
22 {
23     ios::sync_with_stdio(false);
24     cin>>n>>k;
25     inte();
26     for (int i=1;i<=ans;i++)
27       if (king[i]<=k)
28        f[1][i][king[i]]=1;
29     for (int i=2;i<=n;i++)
30       for (int j=1;j<=ans;j++)
31         for (int kk=1;kk<=ans;kk++)
32           {
33                if (sta[j]&sta[kk]) continue;
34                if (sta[j]&(sta[kk]<<1)) continue;
35                if ((sta[j]<<1)&sta[kk]) continue;
36                for (int s=1;s<=k;s++)
37                {
38                    if (s+king[j]>k) continue;
39                    f[i][j][king[j]+s]+=f[i-1][kk][s];
40                }
41           }
42     long long sum=0;
43     for (int i=1;i<=n;i++)
44        for (int j=1;j<=ans;j++)
45           sum+=f[i][j][k];
46     cout<<sum;
47 }