solutions := int32(0)
for i := int32(0); i + m <= int32(len(s)); i++ {
    sum := int32(0)
    for j := int32(0); j < m; j++ {
        sum += s[i + j]
    }
    if sum == d {
        solutions++
    }
}
return solutions

int birthday(vector < int > s, int d, int m) {
    int ways = 0;
    for (int i = 0; i < s.size(); i++) {
        int sum = 0;
        for (int j = i; j < m + i; j++) {
            sum += s[j];
        }
        if (sum == d) {
            ways++;
        }
    }
    return ways;
}

def birthday(s, d, m):
    # Write your code here
    ways=0
    end=m
    begin=0
    
    while end<=len(s):
        summ=0
        for i in range(begin,end):
            summ+=s[i]
        if summ==d:
            ways+=1
        end+=1
        begin+=1
    return ways

fun birthday(s: Array<Int>, d: Int, m: Int): Int {
    return (0 until s.size-m+1).map { i -> s.slice(i until m+i) }.filter { it.sum() == d }.size
}