#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); i++)
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
#define all(a) a.begin(), a.end()
#define pb push_back
const int inf = 1e9;
const ll linf = 2e18;

template<class T>
bool chmin(T &a, T b) {
  if(a > b) {
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b) {
  if(a < b) {
    a = b;
    return true;
  }
  return false;
}

const int C = 1000;

inline int toId(int i, int j, int k) {
    return i * C * C + j * C + k;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  vector<string> s(3);
  rep(i, 3) {
    cin >> s[i];
    s[i] = "." + s[i];
  }
  auto optimize = [](int pos, int y) -> int {
    vi v(3);
    v[0] = pos/(C*C);
    v[1] = pos/C%C;
    v[2] = pos%C;
    int mx = max({v[0],v[1],v[2]});
    rep(i, 3) {
      assert(v[i] <= y);
      if((y-v[i])*(y-v[i]) >= (y-mx)*(y-mx)+4) v[i] = 0;
    }
    return toId(v[0],v[1],v[2]);
  };
  auto next_pos = [&](int pos, int x, int y) -> P {
    vi v(3);
    v[0] = pos/(C*C);
    v[1] = pos/C%C;
    v[2] = pos%C;
    int d = inf;
    rep(i, 3) {
      if(v[i] > 0) {
        chmin<int>(d, (y-v[i])*(y-v[i])+(i-x)*(i-x));
      }
    }
    v[x] = y;
    pos = toId(v[0],v[1],v[2]);
    return {optimize(pos,y), d};
  };
  vector dp(3, vector(n+2, vector<gp_hash_table<int, int>>(k+1)));
  dp[0][1][0][0] = 1e9;
  rep2(j, 1, n+1) rep(i, 3) {
    int ni = i+1, nj = j;
    if(ni == 3) {
      ni = 0, ++nj;
    }
    rep(l, k+1) {
      int mx = 0;
      for(auto [_,val] : dp[i][j][l]) mx = max(mx, val);
      for(auto [pos, val] : dp[i][j][l]) {
        if(mx > 3 and val < mx / 2) continue;
    //  cout << i << ' ' << j << ' ' << l << ' ' << pos << ' ' << val << endl;
      chmax(dp[ni][nj][l][optimize(pos,nj)], val);
      if(l < k and s[i][j] == '.') {
        auto [npos, d] = next_pos(pos, i, j);
        chmax(dp[ni][nj][l + 1][npos], min(val, d));
      }
    }
    }
  }
  int ans = -1;
  for(auto [_, val] : dp[0][n+1][k]) {
    chmax(ans, val);
  }
  if(ans == -1) {
    cout << ans << endl;
  } else {
    cout << fixed << setprecision(15) << sqrt(ans) << endl;
  }
}