#include<cstdio>

 #define maxn 100005

 using namespace std;

 int q[maxn],st[maxn],n,m,k;

 bool g(int a)

 {

     int i;

     for(i=a; i<a+m-; i++)

     {

         if((q[i]==q[i+]&&st[i-a]==st[i-a+])||(q[i]<q[i+]&&st[i-a]<st[i-a+])||(q[i]>q[i+]&&st[i-a]>st[i-a+]))continue;

         else break;

     }

     if(i==a+m-)return ;

     return ;

 }

 int main()

 {

     while(scanf("%d%d%d",&n,&m,&k)!=EOF)

     {

         int ans=;

         for(int i=; i<n; i++) scanf("%d",&q[i]);

         for(int i=; i<m; i++) scanf("%d",&st[i]);

         for(int i=; i<=n-m;) if(g(i))i=i+m,ans++;

             else i++;

         printf("%d\n",ans);

     }

     return ;

 }