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 PHP (7.4.4) (judge verdict: Accepted)

<?php
// D
fscanf(STDIN, '%s', $s);
$n = strlen($s);
$mods = array_fill(0, 2019, 0);
$mods[0]++;
$mod = 0;
$t = 1;
for ($i = $n - 1; $i >= 0; $i--) {
    $mod = ($mod + (int) $s[$i] * $t) % 2019;
    $t = $t * 10 % 2019;
    $mods[$mod]++;
}
$ans = 0;
for ($i = 0; $i < 2019; $i++) {
    $ans += intdiv($mods[$i] * ($mods[$i] - 1), 2);
}
echo $ans;