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