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 Kotlin (1.3.71) (judge verdict: Runtime Error)

fun main(args: Array<String>) {
    val s = readLine()!!.split(" ").map { it.toLong() }[0]
    val sString = s.toString()
    val size = sString.length
    var count = 0
    val xArray:Array<Long> = Array(100){ 0.toLong() }
    for (i in 0 until 100){
        xArray[i] = 2019.toLong() * (i+1)
    }
    for (j in 0 until 100){
        val length = xArray[j].toString().length
        for (i in 0 until size){
            if (length + i > size) break
            val a = sString.substring(i, length+i).toLong()
            if (a == xArray[j]) count++
        }
    }
    println(count)
}