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
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#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 eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 1005
#define nm 32768
#define pi 3.1415926535897931
const int inf=1e9+7;
using namespace std;
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,m,len[nm],d[NM][nm],g[nm][4],cnt[16],tot,ans[16],a[16],dp[16];
char _s[16];
int id(char x){
if(x=='A')return 0;
else if(x=='G')return 1;
else if(x=='C')return 2;
else return 3;
}
void init(){
tot=succ(n)-1;
inc(k,0,tot){
inc(i,1,n)cnt[i]=cnt[i-1]+(k>>(i-1)&1);
len[k]=cnt[n];
inc(v,0,3){
inc(i,1,n){
dp[i]=max(cnt[i],dp[i-1]);
if(v==a[i])dp[i]=max(dp[i],cnt[i-1]+1);
}
dec(i,n,1)g[k][v]=g[k][v]<<1|(dp[i]-dp[i-1]);
}
}
}
int main(){
int _=read();while(_--){
mem(g);mem(d);mem(ans);
scanf("%s",_s+1);n=strlen(_s+1);
inc(i,1,n)a[i]=id(_s[i]);
m=read();
init();
d[0][0]=1;
inc(i,0,m-1)inc(j,0,tot)if(d[i][j])
inc(k,0,3)(d[i+1][g[j][k]]+=d[i][j])%=inf;
inc(j,0,tot)(ans[len[j]]+=d[m][j])%=inf;
inc(i,0,n)printf("%d\n",ans[i]);
}
return 0;
}
|
