//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(),YES,NO))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(i,b) FOR(i,zero,b)
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b-1,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB emplace_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define int long long
#define zero 0LL
#define pb PB
using namespace std;
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef long long LL;
typedef double ld;
typedef LL ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
int dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };
const int SIZE1 =3e5 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 22;
const int SIZE = SIZE1;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
ut N, M, K, X, L, Y,H,W,Q,D;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
VI edges[SIZE];
LL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;
//LL A[SIZE], B[SIZE];
bool nable[SIZE2][SIZE2];
LL cost[SIZE2][SIZE2];
LL A, B;
LL sy, sx, gy, gx;
LL solve() {
	cin >> H >> W >> A >> B;
	string s;
	REP(i, SIZE2) REP(j, SIZE2) cost[i][j] = INF;
	REP(i, H) {
		cin >> s;
		REP(j, W) {
			LL h=i+1, w=j+1;
			maps[h][w]=s[j]=='.';
			//cout << maps[i+1][j+1] << endl;
			if (s[j] == '*') {
				maps[h][w] = 1;
				EFOR(k, -1, 1) EFOR(l, -1, 1)
					nable[h + k][w + l] = true;
			}
			if (s[j] == 'g') {
				maps[h][w] = true;
				gy = h;
				gx = w;
			}
			else if (s[j] == 's') {
				maps[h][w] = true;
				sy = h;
				sx = w;

			}
		}
	}
	PQ qu;
	cost[sy][sx] = 0;
	qu.emplace(cost[sy][sx], pr(sy, sx));
	
	while (!qu.empty()) {
		pr now = qu.top().second;
		LL co = qu.top().first;
		qu.pop();
		LL h = now.first;
		LL w = now.second;
		if (h <= 0 or  h> H or w <= 0 or w> W) continue;
		assert(co >= cost[h][w]);
		if (co != cost[h][w]) continue;
		REP(i, 8) {
			int ny = dy[i] + h, nx = dx[i] + w;
			if (i < 4 and maps[ny][nx]) {
				if(MN(cost[ny][nx],co+A))
					qu.emplace(cost[ny][nx],pr(ny,nx));

			}
			else if (!nable[h][w]) {
				if (i < 4) {
					if (MN(cost[ny][nx], co + B+A))
						qu.emplace(cost[ny][nx],pr(ny,nx));
				}
				else {
					if (MN(cost[ny][nx], co + B + A+A))
						qu.emplace(cost[ny][nx],pr(ny,nx));
				}
			}
		}
	
	}
	if (cost[gy][gx] >= INF/2) {
		cout << "INF" << endl;
		return 0;
	}
	cout << cost[gy][gx] << endl;

	return 0;
}
signed main() {
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	solve();
	//	cin >> N;
	return 0;
}


Measured memory_bytes: 55428