int birthday(vector<int> s, int d, int m) {
    if(s.size() < m) return 0;
    int su = accumulate(s.begin(), s.begin() + m, 0), result = 0;
    if(su == d) result++;
    for(int i = m; i < s.size(); i++){
        su += s[i];
        su -= s[i-m];
        if(su == d) result++;
    }
    return result;
 }

public static int birthday(List<Integer> s, int d, int m) {
    // Write your code here
    int res = 0;
    if(s.size()==1 && s.size()==m){
        if(s.get(0)==d)
            return 1;
    }
    for(int i=0; i<s.size(); i++){
        for(int j=i+1; j<s.size(); j++){
            int count=0;
            for(int k=i; k<=j; k++){
                count++;
            }
            int sum = 0;
            if(count==m){
                for(int k=i; k<=j; k++){
                    sum = sum + s.get(k);
                }
                if(sum==d)
                    res++;
            }
        }
    }
    return res;
    }

int n=0;
for(int i=0;i<s.size();i++)
{
    int sum=0;
    for (int j=i;(j<=i+m-1)&(i+m-1<s.size());j++)
    {
        sum=sum+s[j];
    }
    if(sum==d)
        n++;
}
return n;

fun birthday(s: Array<Int>, d: Int, m: Int): Int {
    var segments= 0
    for(i in s.indices){
      if(i+m-1 <= s.lastIndex && s.copyOfRange(i,i+m).sum() == d){
            segments++
        }
    }
    return segments 
}

def birthday(s, d, m):
    # Write your code here
    return len([i for i in range(len(s)) if sum(s[i : i + m]) == d])