期望复杂度$O(nm\log(m)\log(nm))$

//2025-01-03 14:18:35
#include<bits/stdc++.h>
#define db double
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mkp make_pair
#define pii pair<int,int>
using namespace std;
bool MBE;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f; 
}
const int mxn=2010;
int n,m,q,a2[mxn][mxn],res[mxn][mxn],cnt;
char s[mxn];
multiset<int>tree[mxn<<2];
int calc(int x,int y,int x2,int y2){
	return a2[x][y]+a2[x2-1][y2-1]-a2[x2-1][y]-a2[x][y2-1];
}
int query(int x,int y){
	int l=1,r=min(n-x+1,m-y+1),ans=0;
	while(l<=r){
		int mid=(l+r)>>1;
		if(calc(x+mid-1,y+mid-1,x,y)==0)ans=mid,l=mid+1;
		else r=mid-1;
	}
	return ans;
}
struct node{
	int op,x,l,r,val;
}a[mxn*mxn*2];
bool cmp(node x,node y){
	return x.x<y.x||x.x==y.x&&x.op<y.op;
}
void del(int o,int l,int r,int L,int R,int x){
	if(L<=l&&r<=R){
		tree[o].erase(tree[o].find(x));
		return;
	}
	int mid=(l+r)>>1;
	if(L<=mid)del(o*2,l,mid,L,R,x);
	if(R>mid)del(o*2+1,mid+1,r,L,R,x);
}
void update(int o,int l,int r,int L,int R,int x){
	if(L<=l&&r<=R){
		tree[o].insert(x);
		return;
	}
	int mid=(l+r)>>1;
	if(L<=mid)update(o*2,l,mid,L,R,x);
	if(R>mid)update(o*2+1,mid+1,r,L,R,x);
}
int query(int x){
	if(!tree[x].size())return 0;
	else{
		auto it=tree[x].end();
		return *(--it);
	}
}
int query(int o,int l,int r,int x){
	if(l==r)return query(o);
	int mid=(l+r)>>1,p=query(o);
	if(x<=mid)return max(p,query(o*2,l,mid,x));
	else return max(p,query(o*2+1,mid+1,r,x));
}
signed main(){
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    n=read(),m=read();
    for(int i=1;i<=n;i++){
    	scanf("%s",s+1);
    	for(int j=1;j<=m;j++){
    		a2[i][j]=a2[i-1][j]+a2[i][j-1]-a2[i-1][j-1]+(s[j]=='#');
    	}
    }
    for(int i=1;i<=n;i++)
    	for(int j=1;j<=m;j++){
    		int p=query(i,j);
    		if(!p)continue;
    		a[++cnt]=(node){1,i,j,j+p-1,p};
    		a[++cnt]=(node){0,i+p,j,j+p-1,p};
    	}
    sort(a+1,a+cnt+1,cmp);
    int be=1;
    for(int i=1;i<=n;i++){
    	for(;a[be].x==i&&a[be].op==0&&be<=cnt;be++){
    		del(1,1,m,a[be].l,a[be].r,a[be].val);
    	}
    	for(;a[be].x==i&&be<=cnt;be++){
    		update(1,1,m,a[be].l,a[be].r,a[be].val);
    	}
    	for(int j=1;j<=m;j++)
    		res[i][j]=query(1,1,m,j);
    }
    q=read();
    q=0;
    while(q--){
    	int x=read(),y=read();
    	printf("%d\n",res[x][y]*res[x][y]);
    }
    bool MED;
    cerr<<(&MED-&MBE)/1048576.0<<" MB, "<<1000*clock()/CLOCKS_PER_SEC<<" ms\n";
    return 0;
}