小a和uim之大逃离

题目传送门

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define P pair<int,int>
const int N=1e9;
const int mod=1e9+;
void read(int &a)
{
    a=;
    int d=;
    char ch;
    while(ch=getchar(),ch>''||ch<'')
        if(ch=='-')
            d=-;
    a=ch-'';
    while(ch=getchar(),ch>=''&&ch<='')
        a=a*+ch-'';
    a*=d;
}
void write(int x)
{
    if(x<)
        putchar(),x=-x;
    if(x>)
        write(x/);
    putchar(x%+'');
}
int f[][][][],a[][];
int main()
{
    int n,m,k;
    read(n);
    read(m);
    read(k);
    k++;
    for(re int i=;i<=n;i++)
        for(re int j=;j<=m;j++)
            read(a[i][j]),f[i][j][a[i][j]%k][]=;
    for(re int i=;i<=n;i++)
        for(re int j=;j<=m;j++)
            for(re int h=;h<=k;h++)
            {
                f[i][j][h][]=(f[i][j][h][]+f[i-][j][(h-a[i][j]+k)%k][])%mod;
                f[i][j][h][]=(f[i][j][h][]+f[i][j-][(h-a[i][j]+k)%k][])%mod;
                f[i][j][h][]=(f[i][j][h][]+f[i-][j][(h+a[i][j])%k][])%mod;
                f[i][j][h][]=(f[i][j][h][]+f[i][j-][(h+a[i][j])%k][])%mod;
            }
    ll ans=;
    for(re int i=;i<=n;i++)
        for(re int j=;j<=m;j++)
            ans=(ans+f[i][j][][])%mod;
    printf("%lld",ans);
    return ;
}