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 Go (1.14.1) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	"index/suffixarray"
	"strconv"
)

func main() {
	// Code for D - Multiple of 2019
	var s string
	fmt.Scanf("%s", &s)
	index := suffixarray.New([]byte(s))

	edges := map[int]int{}
	for i := 1; i <= 9999; i++ {
		b := strconv.Itoa(i * 2019)
		lookup := index.Lookup([]byte(b), -1)
		if len(lookup) > 0 {
			for _, start := range lookup {
				edges[start] = start + len(b)
			}
		}
	}

	total := 0
	for i := 0; i < len(s); i++ {
		var ok bool
		end := i
		for {
			end, ok = edges[end]
			if !ok {
				break
			}
			total += 1
		}
	}

	fmt.Printf("%d", total)
}