import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

s = SI()
t = SI()
n = len(s)
m = len(t)

def chmin(i, j, val):
    if i > n or j > m: return
    if val < dp[i][j]: dp[i][j] = val

dp = [[inf]*(m+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n+1):
    if i < n and not s[i].islower(): continue
    for j in range(m+1):
        if j < m and not t[j].islower(): continue
        pre = dp[i][j]

        di, cost = 1, 1
        if i+1 < n and not s[i+1].islower(): di, cost = 2, 0
        chmin(i+di, j, pre+cost)

        dj, cost = 1, 1
        if j+1 < m and not t[j+1].islower(): dj, cost = 2, 0
        chmin(i, j+dj, pre+cost)

        cost = 1
        if i < n and j < m and s[i] == t[j]:
            cost = 0
            if i+1 < n and s[i+1] == "*": chmin(i, j+dj, pre)
            if j+1 < m and t[j+1] == "*": chmin(i+di, j, pre)
        chmin(i+di, j+dj, pre+cost)

print(dp[n][m])