#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	string a, b; cin>>a>>b;
	int n=a.size(), m=b.size();
	int dp[2020][2020];
	dp[0][0]=0;
	for(int i=0; i<n; i++){
		if(!('a'<=a[i] && a[i]<='z')){
			dp[i+1][0]=dp[i][0];
			continue;
		}
		if(i+1<n && !('a'<=a[i+1] && a[i+1]<='z')) dp[i+1][0]=dp[i][0];
		else dp[i+1][0]=dp[i][0]+1;
	}
	for(int i=0; i<m; i++){
		if(!('a'<=b[i] && b[i]<='z')){
			dp[0][i+1]=dp[0][i];
			continue;
		}
		if(i+1<m && !('a'<=b[i+1] && b[i+1]<='z')) dp[0][i+1]=dp[0][i];
		else dp[0][i+1]=dp[0][i]+1;
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			if(!('a'<=a[i] && a[i]<='z')){
				dp[i+1][j+1]=dp[i][j+1];
				continue;
			}
			if(!('a'<=b[j] && b[j]<='z')){
				dp[i+1][j+1]=dp[i+1][j];
				continue;
			}
			dp[i+1][j+1]=min({dp[i][j+1]+1, dp[i+1][j]+1, dp[i][j]+1});
			if(a[i]==b[j]) dp[i+1][j+1]=min(dp[i+1][j+1], dp[i][j]);
			if(i+1<n && !('a'<=a[i+1] && a[i+1]<='z')) dp[i+1][j+1]=min(dp[i+1][j+1], dp[i][j+1]);
			if(j+1<m && !('a'<=b[j+1] && b[j+1]<='z')) dp[i+1][j+1]=min(dp[i+1][j+1], dp[i+1][j]);
			if(i+1<n && a[i+1]=='*' && a[i]==b[j]) dp[i+1][j+1]=min(dp[i+1][j+1], dp[i+1][j]);
			if(j+1<m && b[j+1]=='*' && a[i]==b[j]) dp[i+1][j+1]=min(dp[i+1][j+1], dp[i][j+1]);
		}
	}
	cout<<dp[n][m]<<endl;
	return 0;
}