#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define maxn 800+10

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(long long x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int n,m,k;

 int map[maxn][maxn];

 int dp[maxn][maxn][][];

 int main()

 {

     n=read();m=read();k=read();

     k++;

     for(int i=;i<=n;i++)

         for(int j=;j<=m;j++)

         {

             map[i][j]=read();

             dp[i][j][map[i][j]][]=;

         }

     long long ans=;

     for(int i=;i<=n;i++)

         for(int j=;j<=m;j++)

             for(int p=;p<=k;p++)

             {

                 dp[i][j][p][]=(dp[i][j][p][]+dp[i-][j][(p-map[i][j]+k)%k][])%mod;

                 dp[i][j][p][]=(dp[i][j][p][]+dp[i][j-][(p-map[i][j]+k)%k][])%mod;

                 dp[i][j][p][]=(dp[i][j][p][]+dp[i-][j][(p+map[i][j])%k][])%mod;

                 dp[i][j][p][]=(dp[i][j][p][]+dp[i][j-][(p+map[i][j])%k][])%mod;

             }

     for(int i=;i<=n;i++)

         for(int j=;j<=m;j++)

             ans=(ans+dp[i][j][][])%mod;

     write(ans);

     return ;

 }