1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #define rep(i,l,r) for (int i=l; i<=r; i++)
 5 using namespace std;
 6
 7 const int N=25,md=1000000007;
 8 int h,w,m,n,T,xx[N],yy[N],vv[N],mp[N][N],re[N][N],cnt[N],lx,ly,lv;
 9 struct mat{ int x1,x2,y1,y2,v; }a[N];
10 int ksm(int a,int b){
11     int res;
12     for (res=1; b; a=(1ll*a*a)%md,b>>=1)
13         if (b & 1) res=(1ll*res*a)%md;
14     return res;
15 }
16
17 int main(){
18     freopen("bzoj5010.in","r",stdin);
19     freopen("bzoj5010.out","w",stdout);
20     for (scanf("%d",&T); T--; ){
21         scanf("%d%d%d%d",&h,&w,&m,&n);
22         xx[1]=0; xx[lx=2]=h; yy[1]=0; yy[ly=2]=w; vv[lv=1]=m;
23         rep(i,1,n){
24             scanf("%d%d%d%d%d",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2,&a[i].v);
25             a[i].x1--; a[i].y1--;
26             xx[++lx]=a[i].x1; xx[++lx]=a[i].x2;
27             yy[++ly]=a[i].y1; yy[++ly]=a[i].y2;
28             vv[++lv]=a[i].v; vv[++lv]=a[i].v-1;
29         }
30         sort(xx+1,xx+lx+1); sort(yy+1,yy+ly+1); sort(vv+1,vv+lv+1);
31         lx=unique(xx+1,xx+lx+1)-xx-1; ly=unique(yy+1,yy+ly+1)-yy-1; lv=unique(vv+1,vv+lv+1)-vv-1;
32         rep(i,1,lx) rep(j,1,ly) re[i][j]=(xx[i]-xx[i-1])*(yy[j]-yy[j-1]);
33         rep(i,1,n){
34             a[i].x1=lower_bound(xx+1,xx+lx+1,a[i].x1)-xx;
35             a[i].x2=lower_bound(xx+1,xx+lx+1,a[i].x2)-xx;
36             a[i].y1=lower_bound(yy+1,yy+ly+1,a[i].y1)-yy;
37             a[i].y2=lower_bound(yy+1,yy+ly+1,a[i].y2)-yy;
38             a[i].v=lower_bound(vv+1,vv+lv+1,a[i].v)-vv;
39         }
40         int ans=0;
41         for (int s=0; s<(1<<n); s++){
42             rep(j,1,lx) rep(k,1,ly) mp[j][k]=lv;
43             int now=1;
44             rep(i,1,n){
45                 int v=a[i].v;
46                 if ((s>>(i-1))&1) now=-now,v--;
47                 rep(j,a[i].x1+1,a[i].x2) rep(k,a[i].y1+1,a[i].y2) mp[j][k]=min(mp[j][k],v);
48             }
49             memset(cnt,0,sizeof(cnt));
50             rep(i,1,lx) rep(j,1,ly) cnt[mp[i][j]]+=re[i][j];
51             rep(i,1,lv) if (cnt[i]) now=1ll*now*ksm(vv[i],cnt[i])%md;
52             ans=(ans+now)%md;
53         }
54         printf("%d\n",(ans+md)%md);
55     }
56     return 0;
57 }