HW1_2_pointers

#two pointers

#4j
s = input()
new_s = ""
i, j = 0, 0
while i != len(s):
    while j != len(s) and s[i] == s[j]:
        j += 1
    new_s += f"{s[i]}{j - i}"
    i = j
print(new_s)

#5m
n, s = map(int, input().split())
a = list(map(int, input().split()))
cnt = 0
sum_sub = 0
for l in range(n):
    r = l
    sum_sub = 0
    while r < n:
        sum_sub += a[r]
        if sum_sub > s:
            break

        cnt += 1
        r += 1
print(cnt)

#6s
n, s = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
max_vk = 0
l_max, r_max = -1, -1
for l in range(n):
    sum_subA = a[l]
    sum_subB = b[l]
    r = l
    sum_subA = 0
    sum_subB = 0
    while r < n:
        sum_subA += a[r]
        if sum_subA > s:
            break
        sum_subB += b[r]
        r += 1
    if sum_subB > max_vk:
        max_vk = sum_subB
        l_max, r_max = l+1, r
print(l_max, r_max)