input: Write a Python function named calculate_permutation_distance(s: str, t: str) -> int:
      """
      Given two strings s and t where each character appears no more than once in s, and t is a rearrangement of s.
  
      The permutation distance between s and t is calculated as the sum of the absolute differences between the indices of each character in s and the indices of the corresponding characters in t.
  
      Return the permutation distance between s and t.
  
      Examples:
      >>> s = "abc", t = "bac"
      2
      >>> s = "abcde", t = "edbac"
      12
  
      Constraints:
      1 <= s.length <= 26
      Each character appears no more than once in s.
      t is a rearrangement of s.
      s contains only lowercase English letters.
      """
output: def calculate_permutation_distance(s: str, t: str) -> int:
      return sum(abs(s.index(ch) - t.index(ch)) for ch in s)