def jumpingOnClouds(c, k):
    if len(c) % k != 0:
        return 94
    e=100
    n = len(c)

    itr = 0
    step = []
    while True:
        step.append(c[k * itr])
        itr += 1
        if len(c) <= k * itr:
            break

    print(step)
    cost = len(step) + 2 * step.count(1)
    return e - cost