#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int H,W;
  cin>>H>>W;
  vector<string>S(H);
  for(auto  &i:S)cin>>i;
  vector dist(H,vector(W,1ll<<60));
  dist[0][0]=0;
  auto xy2i=[W](int x,int y){
    return x*W+y;
  };
  auto i2xy=[W](int i){
    return make_pair(i/W,i%W);
  };
  using dijk=pair<ll,int>;
  priority_queue<dijk,vector<dijk>,greater<dijk>> pq;
  pq.push({0ll,0});
  int dx[]={0,1,0,-1};
  int dy[]={-1,0,1,0};
  ll cost[]={1ll<<32,1ll,1ll<<32,1ll};
  auto bound_ok=[H,W](int x,int y){
    return x>=0&&x<H&&y>=0&&y<W;
  };
  while(pq.size()){
    auto d=pq.top();
    pq.pop();
    auto [x,y]=i2xy(d.second);
    if(dist[x][y]<d.first)continue;
    rep(k,4){
      int x2=x+dx[k],y2=y+dy[k];
      if(bound_ok(x2,y2)&&S[x2][y2]=='.'&&dist[x2][y2]>d.first+cost[k]){
        dist[x2][y2]=d.first+cost[k];
        pq.push({dist[x2][y2],xy2i(x2,y2)});
      }
    }
  }
  ll ans=dist[H-1][W-1];
  if(ans==(1ll<<60)){
    cout<<"No\n";
  }else{
    cout<<"Yes\n";
    cout<<(ans>>32)<<' '<<(ans%(1ll<<32))<<'\n';
  }
}