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 JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

"use strict"
function main(arg) {
    let s = arg.trim().split("\n")[0]
    let counter = 0
    for (let i = 0; i < 1000; i++) {
        let x = i * 2019
        if (x > Number(s)) {
            break
        }
        let num = solve(s, String(x))
        counter += num
        // if (num.length > 0) {
        //     console.log(JSON.stringify(num))
        //     // counter += num
        // }
        // console.log(i * 2019)
    }
    console.log(counter)
    // console.log(JSON.stringify(solve("1212121", '121')))
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));

function solve(src, str) {
    let counter = 0
    let start = 0
    for (let i = 0; i < 10000; i++) {
        let n = src.indexOf(str, start)
        // console.log(counter)
        if (n < 0) {
            return counter
        }
        if (n >= 0) {
            counter++
            start = n + 1
        }
    }
    return counter
}