#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <algorithm>

#define max(a,b) ((a) > (b) ? (a) : (b))

#define min(a,b) ((a) > (b) ? (b) : (a))

#define lowbit(a) ((a) & (-(a)))

int read()

{

    int x = 0;char ch = getchar();char c = ch;

    while(ch > '9' || ch < '0')c = ch, ch = getchar();

    while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();

    if(c == '-')return -x;

    return x;

}

const int INF = 0x3f3f3f3f;

const int MAXN = 1000000 + 10;

const int MAXM = 1000 + 10;

int next[MAXN];char s[MAXN];char p[MAXN];

int lens,lenp;

inline void init()

{

    scanf("%s", s);scanf("%s", p);

    lens = strlen(s);lenp = strlen(p);

}

inline void work_next()

{

    int k = -1;int j = 0;

    next[0] = -1;

    while(j < lenp)

    {

        if(k == -1 ||p[k] == p[j])

        {

            k ++;j ++;

            if(p[j] != p[k])

            {

                next[j] = k;

            }

            else

            {

                next[j] = next[k];

            }

        }

        else

        {

            k = next[k];

        }

    }

}

inline int KMP(int k)

{

	work_next();

    int i = k;int j = 0;

    while(i < lens && j < lenp)

    {

        if(j == -1 || s[i] == p[j])

        {

            i ++;j ++;

        }

        else

        {

            j = next[j];

        }

    }

    if(j == lenp)

    {

        return i - j;

    }

    else

    {

        return -1;

    }

}

inline void run()

{

    printf("%d", KMP(0) + 1);

}

int main()

{

    init();

    work_next();

    run();

    return 0;

}