from heapq import heappush,heappop
from collections import deque
t = 1
for tc in range(1,t+1):
s = input()
p = input()
cols = {}
for c in s:
if c not in cols:
cols[c]=[0,0]
cols[c][0]+=1
ans = 0
for c in p:
if c not in cols:
ans=-1
break
cols[c][1]+=1
if ans==-1:
print(ans)
continue
for c in cols:
ans+=min(cols[c])
print(ans)#include<bits/stdc++.h>
using namespace std;
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define nl "\n"
#define MOD 1000000009
#define pb push_back
#define ppb pop_back
#define dbg(x) cerr<<#x<<"-"<<x<<nl;
#define siz 100005
// solve function
void solve(){
string a,b;
cin>>a>>b;
vector<ll>x(26,0);
vector<ll>y(26,0);
for(int i=0;i<(int)a.length();i++) ++x[a[i]-'a'];
for(int j=0;j<(int)b.length();j++) ++y[b[j]-'a'];
ll res = 0;
for(int i=0;i<26;i++){
if(x[i]==0 && y[i]!=0){
cout<<-1<<nl;
return;
}
res += min(x[i],y[i]);
}
cout<<res<<nl;
}
/* main function */
int main(){
clock_t start,end;
start=clock();
fast();
ll t=1;
ll i=1;
/* cin>>t; */
while(t--){
/* cout<<"Case# "<<i<<": "; */
solve();
i++;
}
end=clock();
double time=double(end-start)/double(CLOCKS_PER_SEC);
cerr<<nl<<"Time: "<<time<<" sec"<<nl;
}
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |