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)

(defun f (n)
  (- (char-code n) 48))

(defun ff (lst)
  (let* ((n (reverse lst)))
    (loop :for k :from 0
          :for j :in n
          :sum (* j (expt 10 k)))))

(let* ((len (map 'list #'f (concatenate 'list (read-line))))
       (ln (1- (length len))))
  (princ (loop :for k :from 0 :upto (- ln 3)
               :sum (loop :for x :from (+ k 3) :upto ln
                          :for y := (subseq len k (1+ x))
                          :count (= 0 (mod (ff y) 2019))))))