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: Time Limit Exceeded)

<?php
$s = str_split(trim(fgets(STDIN)));
$s = array_reverse($s);
$n = count($s);
$mod = 2019;

$cnt = 0;
for ($i=0; $i < $n; $i++) {
  $tot = 0;
  $tot += $s[$i] * pow(10, $i);
  for ($j=$i+1; $j < $n; $j++) {
    $tot += $s[$j] * pow(10, $j);

    if ($tot % $mod == 0) {
      $cnt++;
    }
  }
}

echo $cnt;