ll@h,@w;
string@s[h];
DijkstraHeap<ll>d;
d.malloc(h*w,1);
d.change(0,0);
while(d.size){
	ll a=d.pop();
	ll v=d.val[a];
	ll y=a/w;
	ll x=a%w;
	if(y    &&s[y-1][x]!='#')d.change(a-w,v+1);
	if(y<h-1&&s[y+1][x]!='#')d.change(a+w,v+1);
	if(x    &&s[y][x-1]!='#')d.change(a-1,v+h*w);
	if(x<w-1&&s[y][x+1]!='#')d.change(a+1,v+h*w);
}
if(d.visited[h*w-1]){
	wt("Yes");
	ll v=d.val[h*w-1];
	wt(v/(h*w),v%(h*w));
}else{
	wt("No");
}