小鱼的航程

def solve(d, h, n):
    d, h, n = int(d), int(h), int(n)
    km = 0
    remaining = n
    cur_day = d
    cur_hour = h
    while remaining > 0:
        if cur_day in (6, 7):
            cur_day = cur_day % 7 + 1
            cur_hour = 0
            continue
        hours_today = 24 - cur_hour
        if remaining <= hours_today:
            km += remaining * 3
            remaining = 0
        else:
            km += hours_today * 3
            remaining -= hours_today
            cur_day = cur_day % 7 + 1
            cur_hour = 0
    print(km)