#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define Gondozu ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const ld OO = 1e9;
const int N = 26, MX_S = 2e4;

ld dis(int x1,int y1, int x2, int y2){
    return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
}

int h,w,r,s,tx,bx,by;
char g[N][N];
vi dx, dy;

bool valid(int x, int y){
    return x >= 0 && x < h && y >= 0 && y < w && g[x][y] != '.';
}

ld dp[N][N][MX_S];
bool vis[N][N][MX_S];

ld slv(int x, int y, int rem){
    if(rem < 0)
        return OO;
    if(x == tx)
        return 0;

    ld &ret = dp[x][y][rem];
    if(vis[x][y][rem])
        return ret;
    vis[x][y][rem] = true;
    ret = OO;

    for (int i = 0; i < dx.size(); ++i) {
        int nx = x + dx[i], ny = y + dy[i];
        if(valid(nx, ny))
            ret = min(ret, dis(x,y,nx,ny) + slv(nx,ny,rem - (g[nx][ny]-'0')));
    }

    return ret;
}

void TC()
{
    cin >> h >> w >> r >> s;

    tx = -1;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            cin >> g[i][j];
            if(g[i][j] == '.')continue;
            if(!~tx) tx = i;
            bx = i, by = j;
        }
    }

    // fill dx,dy
    for (int x = -3; x <= 3; ++x) {
        for (int y = -3; y <= 3; ++y) {
            if(dis(0,0,x,y) <= r)
                dx.pb(x), dy.pb(y);
        }
    }

    ld ans = slv(bx,by,min(MX_S-1, s) - (g[bx][by]-'0'));
    if(ans == OO) cout << "impossible";
    else cout << fixed << setprecision(8) << ans;
}

int32_t main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#endif
    Gondozu
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}