input: Write a python function to compute the permutation distance between two strings, given that each character appears at most once in the first string and the second string is a permutation of the first string. The permutation distance is calculated as the sum of the absolute differences between the indices of each character in the two strings.
  
  def calculate_permutation_distance(s: str, t: str) -> int:
      """
      You are given two strings s and t. Each character occurs at most once in s, and t is a permutation of s.
  
      The permutation distance between s and t is the sum of the absolute differences between the indices of corresponding characters in s and t.
  
      Return the permutation distance between s and t.
  
      Examples:
      >>> s = "abc", t = "cab"
      3
      >>> s = "xyz", t = "zxy"
      6
  
      Constraints:
      1 <= s.length <= 26
      Each character appears once in s.
      t is a permutation of s.
      s consists only of lowercase English letters.
      """
output: def calculate_permutation_distance(s: str, t: str) -> int:
      return sum(abs(s.index(char) - t.index(char)) for char in s)