#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
void _main();
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;

struct xy {
	ll x, y;

	bool operator<(const xy& b)const {
		if (x==b.x) {
			return y < b.y;
		} else {
			return x<b.x;
		}
	}

	xy operator+(const xy& b)const {
		return {x + b.x, y+b.y};
	}
};

// to : cost 姿 pair
xy dist[501][501];
string MP[501];
int N, M;

ll dx[4] = {0, 0, 1, -1};
ll dy[4] = {1, -1, 0, 0};
xy cst[4] = {{1, 0}, {1,0} , {0, 1}, {0,1}};

void dijkstra() {

	for(int i=1; i<= N; i++)rep(j,1,M) dist[i][j] = {iINF, iINF};

	priority_queue<pair<xy, pll>,vector<pair<xy, pll>>,greater<pair<xy, pll>>> pq;
	// cost : node 형식
	pq.ps({{0,0}, {1, 1}});
	dist[1][1] = {0,0};

	while(!pq.empty()) {
		xy cost = pq.top().f;
		auto [x,y] = pq.top().s;
		pq.pop();
		if (dist[x][y] < cost) continue;
		for(ll j = 0; j<4; j++) {
			ll tx = x + dx[j];
			ll ty = y + dy[j];
			if (tx <= 0|| tx > N || ty <= 0 || ty > M) {
				continue;
			}
			if (MP[tx][ty] == '#') {
				continue;
			}
			xy cost2 = cst[j] + cost;
			if(cost2 < dist[tx][ty]) {
				dist[tx][ty] = cost2;
				pq.ps({cost2, {tx, ty}});
			}
		}
	}
	if (dist[N][M].x == iINF) {
		cout << "No" << endl;
	}else {
		cout << "Yes" << endl;
		cout << dist[N][M].x << " " << dist[N][M].y << endl;
	}
}

void _main() {

	cin >>N >>M;
	for (ll i = 1; i<=N; i++) {
		cin >> MP[i];
		MP[i] = " " + MP[i];
	}

	dijkstra();






}