#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <unordered_map>
#include <unordered_set>

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#define IOS std::ios::sync_with_stdio(false)
#define pb push_back
#define inf 0x3f3f3f3f
#define YES cout << "YES" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define NO cout << "NO" << endl;
#define int long long
#define x first
#define y second
#define cmp [&](PII a, PII b){ return a.y < b.y; }

const int N = 5e5+10, mod = 1e9+7, M = 1e6+5, K = 1e5+10, Z = 2e5+7;

using namespace std;
typedef long long LL;
typedef priority_queue<int> PQI; 
typedef priority_queue <int, vector<int>, greater<>> PQGI;
typedef pair<int, int> PII;

char str[1010], ch[27];

int get_idx(char c)
{
    for(int i = 1; i <= 26; i ++) 
        if(ch[i] == c) return i;
    return 0; 
}

void solve() 
{
    cin >> (ch + 1) >> (str + 1);

    int cnt = 1, t = strlen(str + 1);

    for(int i = 2; i <= t; i ++)
    {
        int s1 = get_idx(str[i]), s2 = get_idx(str[i - 1]);
        if(s1 <= s2) cnt ++;
    }

    cout << cnt << endl;
}

signed main()
{
    IOS; cin.tie(nullptr), cout.tie(nullptr); 
    int T = 1;
//    cin >> T;
    while( T -- ) solve();
    return 0;
}
//这里填你的代码^^
//注意代码要放在两组三个点之间，才可以正确显示代码高亮哦~