from collections import deque
n, m = map(int, input().split())
a = [input() for _ in range(n)]
f = 0
q = deque([(n-2, m-2, 0)])
a[n-2] = a[n-2][:m-2] + '+' + a[n-2][m-1:]
d = ((0, 1), (0, -1), (1, 0), (-1, 0))
while q:
    for i in a:
        print(*i,  sep = '')
    print('\n')
    (y, x, t) = q.popleft()
    for e in d:
        yy, xx = y + e[0], x + e[1]
        if y*x == 1:
            print(t, ['\nYes','\nNo'][f])
            quit()
        if a[yy][xx] in '.T':
            if a[yy][xx] == 'T': f = 1
            q.append((yy, xx, t + 1))
            a[yy] = a[yy][:xx] + '+' + a[yy][xx+1:]
print(t, ['\nYes','\nNo'][f])