#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
	for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
	return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
	for (T& in : v) is >> in;
	return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 5e18;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
	lint from, to;
	lint cost;
	Edge() {

	}
	Edge(lint u, lint v, lint c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c = 1) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<char, lint> valchar;

lint H, W, X, Y;
int main() {
	cin >> H >> W >> X >> Y; X--; Y--;
	V<string> arr(H);
	cin >> arr;
	lint ans = 1;
	REP(i, 4) {
		lint curr_x = X, curr_y = Y;
		lint nx = curr_x + dx[i], ny = curr_y + dy[i];
		while (nx >= 0 && nx < H && ny >= 0 && ny < W && arr[nx][ny] == '.') {
			ans++;
			nx = nx + dx[i], ny = ny + dy[i];
		}
	}
	cout << ans << endk;
}

#include <iostream>
#include <string>
#include <algorithm>

#define MAX_H (100)
#define MAX_W (100)
char map[MAX_H][MAX_W];

int main(void) {
  // input
  int H, W, X, Y;
  std::cin >> H >> W >> X >> Y;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      std::cin >> map[i][j];
    }
  }

  // process
  int res_cnt = 1;
  int add_x[4] = { 0,  0, -1,  1};
  int add_y[4] = {-1,  1,  0,  0};
  X -= 1;
  Y -= 1;
  for (int k = 0; k < 4; k++) {
    int xi = add_x[k];
    int yi = add_y[k];
    while (true) {
      if ((X+xi < 0) || (X+xi >= H) || (Y+yi < 0) || (Y+yi >= W)) {
        break;
      } else if (map[X+xi][Y+yi] == '#') {
        break;
      }
      xi += add_x[k];
      yi += add_y[k];
      res_cnt++;
    }
  }

  // output
  std::cout << res_cnt;

  return 0;
}