int getWays(int n, int* squares, int d, int m){


    // Complete this function
    int sum[105];
    int count=0;
    sum[0]=0;
    for(int i=0;i<n;i++)sum[i+1]=sum[i]+squares[i];
    for(int i=0;i<=n-m;i++){
        if(sum[i+m]-sum[i]==d){
            count++;
        }
    }
    return count;
}

def getWays(squares, d, m):
    tp = (len(squares)-m) + 1 #total number of pieces possible
    return len([1 for i in range(tp) if sum(squares[i:i+m])==d])

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution
{

    static int getWays(int[] squares, int d, int m)
    {
        int ways = 0;
        for (int i = 0; i < squares.Length - (m - 1); i++)
            if (squares.Skip(i).Take(m).Sum() == d) ways++;
        return ways;
    }

    static void Main(String[] args)
    {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] s_temp = Console.ReadLine().Split(' ');
        int[] s = Array.ConvertAll(s_temp, Int32.Parse);
        string[] tokens_d = Console.ReadLine().Split(' ');
        int d = Convert.ToInt32(tokens_d[0]);
        int m = Convert.ToInt32(tokens_d[1]);
        int result = getWays(s, d, m);
        Console.WriteLine(result);
    }
}

static int solve(int n, int[] s, int d, int m)
{
    int result = 0;
    
    for (int i=0; i<n; i++)
    {
        int limit = i + m;
        if (limit > n)
        {
            break;
        }
        
        int sum = 0;
        for (int j=i; j<limit; j++)
        {
            sum += s[j];
        }
        
        if (sum == d)
        {
            ++result;
        }
    }
    
    return result;
}