human
Give me a the Python program you requested given the following:
I found an interesting problem on https://leetcode.com/problems/subarray-sums-divisible-by-k/:
Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K.
 

Example 1:
Input: A = [4,5,0,-2,-3,1], K = 5
Output: 7
Explanation: There are 7 subarrays with a sum divisible by K = 5:
[4, 5, 0, -2, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], [-2, -3]

 
Note:

1 <= A.length <= 30000
-10000 <= A[i] <= 10000
2 <= K <= 10000

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python program you requested.

class Solution:
    def subarraysDivByK(self, A: List[int], K: int) -> int:
        mod_count = Counter({0:1})
        
        ans = 0
        for s in [*accumulate(A)]:
            m = s % K
            if m in mod_count:
                ans += mod_count[m]
            mod_count[m] += 1
        return ans