Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals k.

Example 1:

Input: 1 1 1
k: 2
Output: 2

Example 2:

Input: 1 2 3
k: 3
Output: 2

Constraints:

• 1 ≤ nums.length ≤ 2 × 10⁴
• -1000 ≤ nums[i] ≤ 1000
• -10⁷ ≤ k ≤ 10⁷

Input format: First line: space-separated array. Second line: k.

Output format: Count of subarrays.