class Solution:
    def canArrange(self, arr: List[int], k: int) -> bool:
      res = [x%k for x in arr]
      res.sort()
      if res.count(0) % 2 == 1:
        return False
      i = 0
      j = len(arr) - 1
      while i < j:
        if res[i] == 0:
          i += 1
          continue
        if (res[i] + res[j]) != k:
          return False
        i += 1
        j -= 1
      return True