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
|
#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 eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 50005
#define nm 100005
const double pi=acos(-1);
const int inf=10007;
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;
}
struct edge{int t;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y){o->t=y;o->next=h[x];h[x]=o++;}
int n,m,_x,_y,st[155][155],d[NM][155],p[NM][155];
void dfs1(int x,int f){
link(x)if(j->t!=f){
dfs1(j->t,x);
d[x][0]+=d[j->t][0];d[x][0]%=inf;
inc(i,1,m)d[x][i]+=d[j->t][i]+i*d[j->t][i-1],d[x][i]%=inf;
}
d[x][0]++;
}
void dfs2(int x,int f){
inc(i,0,m)p[x][i]+=d[x][i],d[x][i]%=inf;
link(x)if(j->t!=f){
p[j->t][0]=p[x][0]-d[j->t][0]+inf;p[j->t][0]%=inf;
p[j->t][1]=((p[x][1]-d[j->t][1]-d[j->t][0])+(p[x][0]-d[j->t][0]))%inf+inf;p[j->t][1]%=inf;
inc(i,2,m)p[j->t][i]=((p[x][i]-d[j->t][i]-i*d[j->t][i-1])%inf+i*(p[x][i-1]-d[j->t][i-1]-(i-1)*d[j->t][i-2]%inf))%inf+inf,p[j->t][i]%=inf;
dfs2(j->t,x);
}
}
int main(){
n=read();m=read();
inc(i,2,n){_x=read();_y=read();add(_x,_y);add(_y,_x);}
dfs1(1,0);
dfs2(1,0);
st[1][1]=1;
inc(i,2,m)inc(j,1,m)st[i][j]=(st[i-1][j-1]+j*st[i-1][j])%inf;
inc(i,1,n){
int ans=0;
inc(j,0,m)ans+=st[m][j]*p[i][j],ans%=inf;;
printf("%d\n",ans);
}
return 0;
}
|
