input: from typing import List
  from collections import defaultdict
  from math import isqrt
  def find_good_pairs(nums1: List[int], nums2: List[int], k: int) -> int:
      """
      You're provided with two integer arrays nums1 and nums2 having lengths n and m respectively, along with a positive integer k.
  
      A pair (i, j) is termed as good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
  
      Return the total count of such good pairs.
  
      Examples:
      >>> nums1 = [1,3,4], nums2 = [1,3,4], k = 1
      5
      >>> nums1 = [1,2,4,12], nums2 = [2,4], k = 3
      2
  
      Constraints:
      1 <= n, m <= 50
      1 <= nums1[i], nums2[j] <= 50
      1 <= k <= 50
      """
output:     def find_good_pairs(nums1: List[int], nums2: List[int], k: int) -> int:
      count = 0
      for i in range(len(nums1)):
          for j in range(len(nums2)):
              if nums1[i] % (nums2[j] * k) == 0:
                  count += 1
      return count