/// O(n+m)
#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
int failure[maxn];

void buil_failure_function(string pattern, int m)
{
    failure[0] = 0;
    failure[1] = 0;

    for(int i = 2; i <= m; i++){
        // i is the length of the prefix we are dealing with
        // j is the index of the largest next partial match
        // (the largest suffix/prefix) of the string under index i - 1;

        int j = failure[i - 1];
        while(true){
            // check if the last character of prefix of length i "expands" the current "candidate"
            if(pattern[j] == pattern[i - 1]){
                failure[i] = j + 1;
                break;
            }
            // if we can't "expand" even the empty string
            if(j == 0){
                failure[i] = 0;
                break;
            }
            // else go to the next best "candidate" partial match
            j = failure[j];
        }
    }
}

bool kmp(string text, string pattern)
{
    int n = text.size();
    int m = pattern.size();
    buil_failure_function(pattern, m);
    int i = 0; // the initial state of the automation is the empty string
    int j = 0; // the first character of the string

    while(true){
        if(j == n)
            return false; // reached the end of the text

        // character matched
        if(text[j] == pattern[i]){
            i++; // change the state of the automation
            j++; // get the next character from the text
            if(i == m) return true;
        }
        else{
            if(i == 0){
                // if we reached the empty string and failed to
                // "expand" even it; we go to the next
                // character from the text, the state of the
                // automation remains zero
                j++;
            }
            else{
                // we try to "expand" the next best(largest) match
                i = failure[i];
            }
        }
    }
    return false;
}


int main()
{
    string text, pattern;
    cin >> text >> pattern;
    cout << kmp(text, pattern)<<endl;
    return 0;
}