#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pii pair<int, int>
#define fi first
#define se second
int n, q, t[200010];
int rep[1000];
int dp[310][310][310], vis[310][310], able[310][310][310];
char s[310][310], r[310];
void read(){
	memset(r, ' ', sizeof r);
	while(r[1] == ' ' || r[1] == '\n' || r[1] == '\0')
		scanf("%s", r + 1);
}
void bfs(int w){
	memset(vis, 0, sizeof vis);
	deque<pii> q;
	q.push_back({1, 1});
	dp[w][1][1] = !!able[w][1][1];
	vis[1][1] = true;
	while(q.size()){
		pii u = q.front();
		q.pop_front();
		int x = u.fi, y = u.se;
		//cout << x << " " << y << "\n";
		for(int xx = max(x - 1, 1) ; xx <= x + 1 && xx <= n ; xx++)
			for(int yy = max(1, y - (xx == x)) ; yy <= y + (xx == x) && yy <= n ; yy++){
				if(!vis[xx][yy]){
					vis[xx][yy] = true;
					dp[w][xx][yy] = dp[w][x][y] + !!able[w][xx][yy];
					if(!!able[w][xx][yy])
						q.push_back({xx, yy});
					else
						q.push_front({xx, yy});
				}
			}
	}
}
int main(){
	scanf("%d%d", &n, &q);
	for(int i = 1 ; i <= n ; i++){
		read();
		copy(r + 1, r + n + 1, s[i] + 1);
	}
	rep['L'] = 1;
	rep['D'] = 2;
	rep['R'] = 4;
	rep['U'] = 8;
	/*
	for(int i = 1 ; i <= n ; i++)
		for(int j = 1 ; j <= n ; j++)
			printf("%c%c", s[i][j], " \n"[j == n]);
	//*/
	for(int i = 1 ; i <= n ; i++)
		for(int j = 1 ; j <= n ; j++){
			able[1][i][j] = rep[s[i][j]];
			//dp[1][i][j] = able[1][j][j] + min();
		}
	for(int k = 2 ; k <= n ; k++)
		for(int i = 1 ; i <= n ; i++)
			for(int j = 1 ; j <= n ; j++){
				able[k][i][j] |= (able[k - 1][i][j + 1] & 1) | (able[k - 1][i + 1][j] & 8) | (able[k - 1][i][j - 1] & 4) | (able[k - 1][i - 1][j] & 2);
				able[k][i][j] |= able[k - 1][i][j ];
			}
	/*
	for(int k = 2 ; k <= n ; k++)
		for(int i = 1 ; i <= n ; i++)
			for(int j = 1 ; j <= n ; j++)
				printf("%lld%c", able[k][i][j], " \n"[j == n]);
	//*/
	for(int i = 1 ; i <= n ; i++)
		bfs(i);
	for(int i = 1 ; i <= q ; i++){
		scanf("%lld", t + i);
		t[i] = min(t[i], n);
		printf("%lld\n", dp[t[i]][n][n]);
	}
	return 0;
}
/*
5 3
....L
..D..
.....
R..U.
.....
1
3
6
*/