#pragma comment(linker, "/STACK:60777216")  

#include <cassert>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<complex>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<cstdlib>
#include<memory.h>
#include<ctime>
#include<bitset>
#include<fstream>
#include<queue>

using namespace std;


typedef long double ld;

typedef long long ll;
typedef pair<int,int>	pii;
typedef pair<ld,ld>	pdd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef pair<ll,ll> pl;

#define FOR(i,a,b)		for(int i=(a);i<(b);i++)
#define REP(i,n)		FOR(i,0,n)
#define SORT(v)			sort((v).begin(),(v).end())
#define UN(v)			SORT(v),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define CL(a,b)			memset(a,b,sizeof a)
#define pb				push_back

int n,m,q;
int a[1111][1111];
int   t[111111];
ll    r[111111];

#include <ext/hash_map>

using namespace __gnu_cxx;

hash_map<int,ll> cnt;

int p[1111111];
int P(int x){return p[x]==x?x:p[x]=P(p[x]);}
ll fp[1111111];
int mx[1111111];
int my[1111111];

int b[1111][1111];

ll st3[1111];
ll st5[1111];


int main(){	
#ifdef LocalHost
	freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
#endif
#ifndef LocalHost
	freopen("2014.in","r",stdin);
	freopen("2014.out","w",stdout);
#endif

	st3[0]=st5[0]=1;
	FOR(i,1,1111){
		st3[i]=st3[i-1]*3;
		st5[i]=st5[i-1]*5;
	}

	cin>>n>>m;
	//n=1000;m=1000;
	vector<pair<int,pii> > v;
	REP(i,n)REP(j,m){
		scanf("%d",&a[i][j]);
		//a[i][j]=rand();
		if(a[i][j])
		v.push_back(make_pair(a[i][j],pii(i,j)));
	}
	cin>>q;
	REP(i,q)scanf("%d",t+i);
	ll sum = 0;
	int pos = q-1;
	sort(v.rbegin(),v.rend());
	int num = 0;CL(r,-1);
	for(int i=0;i<v.size();){
		while(pos>=0 && t[pos]>=v[i].first){
			r[pos] =sum;
			pos--;
		}
		int j = i;
		while(j<v.size() && v[i].first == v[j].first){
			++num;
			int x = v[j].second.first;
			int y = v[j].second.second;
			b[x][y]=num;
			p[num]=num;
			mx[num]=x;
			my[num]=y;
			fp[num]=1;
			sum += (cnt[fp[num]]++);
			vi jn;
			jn.pb(num);
			for(int dx=-1;dx<=1;dx++)for(int dy=-1;dy<=1;dy++)if(abs(dx)+abs(dy)==1){
				if(x+dx>=0 && x+dx<n && y+dy>=0 && y+dy<m){
					if(b[x+dx][y+dy]){
						jn.pb(P(b[x+dx][y+dy]));
					}
				}
			}
			UN(jn);
			int mxn = x;
			int myn = y;
			REP(k,jn.size()){
				mxn=min(mxn,mx[jn[k]]);
				myn=min(myn,my[jn[k]]);
			}
			ll nf =0;
			REP(k,jn.size()){
				int tt = (--cnt[fp[jn[k]]]);
				sum -= tt;
				if(tt==0) cnt.erase(fp[jn[k]]);
				nf += fp[jn[k]]*st3[mx[jn[k]]-mxn]*st5[my[jn[k]]-myn];				
			}
			REP(k,jn.size()){
				p[jn[k]]=num;
			}
			mx[num]=mxn;
			my[num]=myn;
			fp[num]=nf;
			sum += cnt[nf];
			cnt[nf]++;
			++j;
		}

		i=j;
	}
	while(pos>=0){
		r[pos]=sum;
		pos--;
	}

	REP(i,q) printf("%I64d\n", r[i]);



#ifdef LocalHost
	printf("TIME: %.3lf\n",ld(clock())/CLOCKS_PER_SEC);
#endif
	return 0;
}