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
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<bitset>
#include<cmath>
#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 succ(x) (1ll<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 305
#define nm 2005
using namespace std;
const double pi=acos(-1);
const double eps=1e-8;
const ll inf=1e9+7;
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,a[NM][NM],k,cnt,w[nm],_t;
ll d[2][NM][nm];
inline void reduce(ll&x){x+=x>>63&inf;}
inline int id(int x){return x<=cnt/2?cnt-x+1:(k-1)/x+1;}
int main(){
n=read();m=read();k=read();
inc(i,1,n)inc(j,1,m)a[i][j]=read();
cnt=sqrt(k);
inc(i,1,cnt)w[i]=(k-1)/i+1;
while(w[cnt]>1)w[cnt+1]=w[cnt]-1,cnt++;
d[0][1][id(k)]=1;_t=0;
inc(i,1,n){
_t^=1;mem(d[_t]);
inc(j,1,m)inc(k,1,cnt){
reduce(d[_t][j][id((w[k]-1)/a[i][j]+1)]+=d[_t^1][j][k]-inf);
if(j<m)reduce(d[_t][j+1][id((w[k]-1)/a[i][j+1]+1)]+=d[_t][j][k]-inf);
}
}
printf("%lld\n",d[_t][m][id(1)]);
return 0;
}
|
