Naive_KMP

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pb push_back
#define fe first
#define se second
#define nl "\n"
#define pp pair < ll , ll >
#define sz(x) (ll)x.size()
#define st(x) sort(x.begin(),x.end())
#define rst(x) sort(x.rbegin(), x.rend())
#define all(x) x.begin(),x.end()
long double pi = 3.14159265358979323;

const double EPS = 1e-12;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;

bool naive(string &s , string &t){

      for(int i  = 0 ; i < sz(s) - sz(t) + 1 ; i++ ){
          bool match = 1 ;
          for(int j = 0 ; j < sz(t) ; j++){
                if(s[i+j] != t[j]){
                 match = 0 ;
                 break;
                }
          }
          if(match)return 1;

      }
      return 0 ;
}


int main()
{
    fast;
    string s , t;
    cin >> s >> t ;
    cout << naive(s,t);























    return 0;

}