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 Perl (5.26.1) (judge verdict: Accepted)

#!/usr/bin/perl

my $s = scalar(<STDIN>);
$s =~ s/[\x00-\x20]+$//ios;

my $n = length($s);

my $d = 0;
my $dec = 1;
my %m = ('0'=>1);
for(my $i=$n-1;$i>=0;$i--){
  my $dd =  $d + $dec * ( substr($s,$i,1) - 0 );
  $dd = $dd % 2019;
  $m{$dd} ++;
  $d = $dd;
  $dec = ( $dec * 10 ) % 2019;
}

my $tt = 0;
foreach my $k (keys %m){
  my $v = $m{$k};
  $tt += $v * ( $v - 1 ) / 2;
}
print "$tt\n";