#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

using Weight = int;
struct Edge {
	int s, d; Weight w;
	Edge() {};
	Edge(int s, int d, Weight w) : s(s), d(d), w(w) {};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) { return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')'); }

using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;

void addArc(Graph &g, int s, int d, Weight w = 1) {
	g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
	addArc(g, a, b, w);
	addArc(g, b, a, w);
}

auto dijkstra = [&](const Graph &g, int s, Array &dist) {
	int n = g.size();
	vector<bool> vis(n);
	vector<int> prev(n, -1);
	dist.assign(n, INF); dist[s] = 0;
	using State = tuple<Weight, int, int>;
	priority_queue<State, vector<State>, greater<State>> pq;
	pq.emplace(0, s, -1);
	while (pq.size()) {
		Weight d; int v, p; tie(d, v, p) = pq.top(); pq.pop();
		if (dist[v] < d)continue;
		vis[v] = true;
		prev[v] = p;
		for (auto &e : g[v]) {
			if (vis[e.d])continue;
			if (dist[e.d] > dist[v] + e.w) {
				dist[e.d] = dist[v] + e.w;
				pq.emplace(dist[e.d], e.d, v);
			}
		}
	}
	return prev;
};

vector<int> getPath(int s, int g, vector<int> prev) {
	vector<int> path;
	path.emplace_back(g);
	for (int i = g; i != s; ) {
		if (i == -1)
			return vector<int>();
		path.emplace_back(i = prev[i]);
	}
	reverse(path.begin(), path.end());
	return path;
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int H, W, A, B; cin >> H >> W >> A >> B;
	vector<vector<char>> c(H, vector<char>(W));
	rep(i, 0, H) rep(j, 0, W) { cin >> c[i][j]; }
	Graph g(H*W * 2);
	int si, sj, gi, gj;
	auto idx = [&](int i, int j, int k) {return (H*W)*k + i * W + j; };
	auto inrange = [&](int i, int j) { return i >= 0 && i < H && j >= 0 && j < W; };
	rep(i, 0, H)rep(j, 0, W) {
		if (c[i][j] == 's') {
			si = i, sj = j;
		}
		else if (c[i][j] == 'g') {
			gi = i, gj = j;
		}
		static const int di[] = { 1,0,-1,0 };
		static const int dj[] = { 0,1,0,-1 };
		rep(d, 0, 4) {
			int ni = i + di[d], nj = j + dj[d];
			if (!inrange(ni, nj))continue;
			if (c[ni][nj] == '#')continue;
			addArc(g, idx(i, j, 0), idx(ni, nj, 0), A);
		}
		bool bomb = false;
		rep(di, -1, 2)rep(dj, -1, 2) {
			int ni = i + di, nj = j + dj;
			if (!inrange(ni, nj))continue;
			if (c[ni][nj] == '*')
				bomb = true;
		}
		if (!bomb) {
			rep(di, -1, 2)rep(dj, -1, 2) {
				if (di == 0 && dj == 0)continue;
				int ni = i + di, nj = j + dj;
				if (!inrange(ni, nj))continue;
				int cost = (abs(di) + abs(dj)) * A + B;
				addArc(g, idx(i, j, 0), idx(ni, nj, 1), cost);
			}
		}
		addArc(g, idx(i, j, 1), idx(i, j, 0), 0);
	}
	Array dist;
	dijkstra(g, idx(si, sj, 0), dist);
	//vector<int> prev = dijkstra(g, idx(si, sj, 0), dist);
	if(dist[idx(gi, gj, 0)] == INF)
		cout << "INF" << endl;
	else
		cout << dist[idx(gi, gj, 0)] << endl;
	//vector<int> path = getPath(idx(si, sj, 0), idx(gi, gj, 0), prev);
	//for (auto v : path) {
	//	int k = v / (H*W);
	//	v %= (H*W);
	//	int i = v / W;
	//	int j = v % W;
	//	dump(i, j, k);
	//}
	return 0;
}


Measured memory_bytes: 207444