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 Python (3.8.2) (judge verdict: Wrong Answer)

if __name__ == "__main__":

    s = input().strip()
    dp = [0] * (len(s) + 1)
    mod = 2019
    for i in range(4, len(s)+1):
        if int(s[i-4:i]) % mod == 0:
            dp[i] += 1 + dp[i-4]
        if i >= 5 and int(s[i-5:i]) % mod == 0:
            dp[i] += 1 + dp[i-5]
        if i >= 6 and int(s[i-6:i]) % mod == 0:
            dp[i] += 1 + dp[i-6]
        if i >= 7 and int(s[i-7:i]) % mod == 0:
            dp[i] += 1 + dp[i-7]
    print(sum(dp))