Subarray Sums Divisible by K

Given an integer array `nums` and an integer `k`, return the number of non-empty subarrays that have a sum divisible by `k`. A subarray is a contiguous part of an array. ### Constraints - `1 <= nums.length <= 3 * 10^4` - `-10^4 <= nums[i] <= 10^4` - `2 <= k <= 10^4` ### Input Format - Line 1: Space-separated integers representing `nums`. - Line 2: An integer `k`. ### Output Format Print the number of subarrays divisible by `k`.