题解 | #字母收集#

def check(a):
    if a=="l":
        return 4
    elif a=="o":
        return 3
    elif a=="v":
        return 2
    elif a=="e":
        return 1
    else:
        return 0
m,n=map(int, input().split())
s=[]
for i in range(m):
    s.append(list(input()))
dp=[[0 for i in range(n+1)] for j in range(m+1)]
for i in range(m):
    for j in range(n):
        p=check(s[i][j])
        dp[i+1][j+1]=max(dp[i][j+1]+p,dp[i+1][j]+p)
print(dp[-1][-1])