/*input
contest
son


*/
 
/*
                                                    ______________
                                                          |       )
                                                          |   )   /
                                                          |______/
                                                    |     |      \
                                                    |     |   )   \
                                                    |_____|_______)
 
*/
 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <iomanip>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll , ll> PLL;
typedef long double ld;
 
#define pb push_back
#define all(c) c.begin(),c.end()
#define allr(c) c.rbegin(),c.rend()
int mod = 1000000007;
const int inf = 1034567891;
const ll LL_INF = 1234567890123456789ll;
#define PI 3.14159265
// #define endl '\n'
#define F first
#define S second
#define debug(x) cout << #x << " = " << x << endl;
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
#define out(container) for (auto it : container) cout << it << " "; cout << endl;
 
 
template < typename T > T GCD(T a, T b)            { ll t; while(a) { t = a; a = b % a; b = t; } return b; }
template < typename T > string toString(T a)       { return to_string(a); }
template < typename T > void toInt(string s, T &x) { stringstream str(s); str >> x;}
inline int add(int x, int y){ x += y; if(x >= mod) x -= mod; return x;}
inline int sub(int x, int y){ x -= y; if(x < 0) x += mod; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % mod;}
inline int powr(int a, ll b){
  int x = 1 % mod;
  while(b){
    if(b & 1) x = mul(x, a);
    a = mul(a, a);
    b >>= 1;
  }
  return x;
}
inline int inv(int a){ return powr(a, mod - 2);}

int cnt1[26], cnt2[26];
vector <int> vec[26];

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  string str1, str2;
  cin >> str1 >> str2;
  int n = str1.size();
  int m = str2.size();
  for (int i = 0; i < n; i++) {
    auto it = str1[i];
    cnt1[it - 97]++;
    vec[it - 97].pb(i);
  }
  for (int i = 0; i < m; i++) {
    auto it = str2[i];
    cnt2[it - 97]++;
  }
  for (int i = 0; i < 26; i++) {
    if (cnt2[i] && !cnt1[i]) {
      cout << -1 << endl;
      return 0;
    }
  }
  int cur = -1;
  ll ans = n;
  bool ok = false;
  for (int i = 0; i < m; i++) {
    int v = str2[i] - 97;
    int ind = lower_bound(all(vec[v]), cur) - vec[v].begin();
    if (ind == vec[v].size()) {
      cur = -1;
      ind = lower_bound(all(vec[v]), cur) - vec[v].begin();
      ans += n;
      ok = true;
    }
    cur = vec[v][ind] + 1;
    if (ok && i == m - 1) {
      ans -= n;
      ans += cur;
    }
  }
  if (!ok) {
    ans -= n;
    ans += cur;
  }
  cout << ans << endl;


  return 0;
}

Measured memory_bytes: 1228