#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #define maxn 1005

 using namespace std;

 string s1,s2;

 int f[maxn],ans;

 void kmp(string &x,string &y)

 {

     int le=x.size(),j=,ll=y.size();

     for (int i=;i<le;i++)

     {

         while (j&&x[i]!=y[j])

             j=f[j];

         if (x[i]==y[j]) j++;

         if (j==ll) {

             ans++;//j=0;

         }

     }

 }

 void find(string &x)

 {

     int ll=x.size(),j=;

     f[]=;f[]=;

     for (int i=;i<ll;i++)//从第二个点开始

     {

         j=f[j];

         while (j&&x[j]!=x[i]) j=f[j];

         f[i+]= x[j]==x[i] ? j+ : ;

     }

 }

 int main()

 {

     //freopen("2087kmp.in","r",stdin);

     while (cin>>s1&&s1[]!='#')//cin不读空格

     {

         cin>>s2;

         memset(f,,sizeof (f));

         ans=;

         find(s2);

         kmp(s1,s2);

         cout<<ans<<endl;

     }

     return ;

 }