#include <bits/stdc++.h>
#define rep(i, n) for(long long i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;

using lint = long long;

vector<int> di = {-1, 0, 1, 0};
vector<int> dj = {0, 1, 0, -1};

int main() {
    int h, w;
    cin >> h >> w;
    vector<vector<char>> s(h, vector<char>(w));
    rep(i, h) rep(j, w) {
        cin >> s[i][j];
    }
    auto inc = [&](int i, int j) {
        return (0 <= i && i < h && 0 <= j && j < w);
    };
    vector<vector<pair<int, int>>> d(h, vector<pair<int, int>>(w, {1e9, 1e9}));
    d[0][0] = {0, 0};
    queue<pair<int, int>> q;
    q.emplace(0, 0);
    while (!q.empty()) {
        auto [i, j] = q.front();
        q.pop();
        auto [lr, ud] = d[i][j];
        rep(k, 4) {
            int ni = i + di[k], nj = j + dj[k];
            if (!inc(ni, nj)) {
                continue;
            }
            if (s[ni][nj] == '#') {
                continue;
            }
            int nlr = (k % 2 == 0 ? lr : lr + 1);
            int nud = (k % 2 == 0 ? ud + 1 : ud);
            pair<int, int> np = {nlr, nud};
            if (d[ni][nj] > np) {
                d[ni][nj] = np;
                q.emplace(ni, nj);
            }
        }
    }
    auto [lr, ud] = d[h - 1][w - 1];
    if (lr == 1e9 && ud == 1e9) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
        cout << lr << " " << ud << endl;
    }
}