Problem:
Score : 400 points

Problem Statement

Given is a string S consisting of digits from 1 through 9.

Find the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:

Condition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.

Constraints

1 ≤ |S| ≤ 200000

S is a string consisting of digits from 1 through 9.

Input

Input is given from Standard Input in the following format:

S

Output

Print the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.

Sample Input 1

1817181712114

Sample Output 1

3

Three pairs - (1,5), (5,9), and (9,13) - satisfy the condition.

Sample Input 2

14282668646

Sample Output 2

2

Sample Input 3

2119

Sample Output 3

0

No pairs satisfy the condition.

Solution in PyPy3 (7.3.0) (judge verdict: Wrong Answer)

from collections import deque

S = input()
N = len(S)
sub_s = ""

total = 0

for l in range(N):  # 200000
    if l % 2 == 0:
        # 左から右に伸ばしていく
        sub_s = S[l]

        if int(sub_s) % 2019 == 0:
            total += 1
        r = l + 1
        while r < N:  # 末尾N-1まで
            sub_s += S[r]
            if int(sub_s) % 2019 == 0:
                total += 1
                # print((l, r))
                # print(sub_s)
            r += 1
    else:
        # 右を縮めていく
        # r = N  # 末尾から
        r = 1
        # while r > l:
        while r < (N - l):
            # sub_s = S[l:r]  # ここが重いはず
            sub_s = sub_s[:-r] # ここが重いはず

            if not sub_s:
                break
            if int(sub_s) % 2019 == 0:
                total += 1
                # print((l, r))
                # print(sub_s)
            # r -= 1
            r += 1
    # print("--------")

ans = total

print(ans)