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 Rust (1.42.0) (judge verdict: Wrong Answer)

use proconio::marker::Bytes;
use proconio::{fastout, input};

#[fastout]
fn main() {
    input! {
        s: Bytes,
    }
    let m: i64 = 2019;
    let mut v: Vec<i64> = vec![0; m as usize];
    let mut tmp: i64 = 0;
    let mut ans: i64 = 0;
    let mut k = 1;
    v[0] = 1;
    for i in 0..s.len() {
        let i = s.len() - 1 - i;
        let c = (s[i] - '0' as u8) as i64;
        tmp = (tmp + c * k) % m;
        k = (k * 10) % m;
        ans += v[tmp as usize];
        ans %= m;
        v[tmp as usize] += 1;
    }
    println!("{}", ans);
}