#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr long long INF = 1002003004005006007;
vector<long long> dijkstra(const auto& to, int s = 0) {
  struct QueElem {
    int v;
    long long d;
    bool operator<(const QueElem& a) const { return d > a.d; }
    QueElem(int v, long long d) : v(v), d(d) {}
  };
  priority_queue<QueElem> q;
  vector<long long> dist(to.size(), INF);
  dist[s] = 0;
  q.emplace(s, 0);
  while (!q.empty()) {
    auto [u, d] = q.top(); q.pop();
    if (d > dist[u]) continue;
    for (auto [v, dv] : to[u]) {
      long long nd = d + dv;
      if (nd < dist[v]) {
        dist[v] = nd;
        q.emplace(v, nd);
      }
    }
  }
  return dist;
}


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  vector<string> s(h);
  rep(i, h) cin >> s[i];
  vector<vector<pair<int, ll>>> to(h * w);
  constexpr int B = 1001001001;
  rep(i, h) rep(j, w - 1) if (s[i][j] != '#' && s[i][j+1] != '#') {
    int u = i * w + j, v = u + 1;
    to[u].emplace_back(v, B);
    to[v].emplace_back(u, B);
  }
  rep(i, h - 1) rep(j, w) if (s[i][j] != '#' && s[i+1][j] != '#') {
    int u = i * w + j, v = u + w;
    to[u].emplace_back(v, 1);
    to[v].emplace_back(u, 1);
  }
  auto ans = dijkstra(to, 0)[h * w - 1];
  if (ans == INF) {
    cout << "No\n";
    return 0;
  }
  cout << "Yes\n";
  cout << ans / B << ' ' << ans % B << '\n';
}