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 Common Lisp (SBCL 2.0.3) (judge verdict: Time Limit Exceeded)

(defvar arr1 (make-array 2019 :initial-element 0))
(defvar arr2 (make-array 2019))

(defun solve (S)
  (loop for x in S with result = 0 do 
        (loop for i below 2019 with j do
              (setf j (mod (+ (* 10 i) x) 2019))
              (setf (aref arr2 j) (aref arr1 i)))
        (incf (aref arr2 x))
        (incf result (aref arr2 0))
        (rotatef arr1 arr2)
        finally (princ result)))


;(solve (loop repeat 200000 collect 1))

(solve (map 'list #'digit-char-p (read-line)))