"""simple docstring"""
from string import ascii_uppercase





def  lowerCAmelCase__     (      _UpperCamelCase							:					str			,      _UpperCamelCase							:					str			,      _UpperCamelCase							:					bool = False			,      _UpperCamelCase							:					str = ascii_uppercase       )       ->					str:





						"""simple docstring"""






						snake_case             =      keyword.upper()
						snake_case             =      plaintext.upper()
						snake_case             =      set(_UpperCamelCase       )

						# create a list of unique characters in the keyword - their order matters
						# it determines how we will map plaintext characters to the ciphertext
						snake_case             =      []
						for char in keyword:
												if char in alphabet_set and char not in unique_chars:
																		unique_chars.append(_UpperCamelCase       )
    # the number of those unique characters will determine the number of rows
						snake_case             =      len(_UpperCamelCase       )

						# create a shifted version of the alphabet
						snake_case             =      unique_chars + [
						    char for char in alphabet if char not in unique_chars
						]

						# create a modified alphabet by splitting the shifted alphabet into rows
						snake_case             =      [
						    shifted_alphabet[k : k + num_unique_chars_in_keyword]
						    for k in range(0			,      2_6			,      _UpperCamelCase       )
						]

						# map the alphabet characters to the modified alphabet characters
						# going 'vertically' through the modified alphabet - consider columns first
						snake_case             =      {}
						snake_case             =      0
						for column in range(_UpperCamelCase       ):
												for row in modified_alphabet:
																		# if current row (the last one) is too short, break out of loop
																		if len(_UpperCamelCase       ) <= column:
																								break

																		# map current letter to letter in modified alphabet
																		snake_case             =      row[column]
																		letter_index += 1

						if verbose:
												print(_UpperCamelCase       )
						# create the encrypted text by mapping the plaintext to the modified alphabet
						return "".join(mapping[char] if char in mapping else char for char in plaintext       )


if __name__ == "__main__":
					# example use
					print(mixed_keyword("college", "UNIVERSITY"))








from string import ascii_uppercase

def       lowerCAmelCase_      (	lowerCamelCase:							str  ,					lowerCamelCase:							str  ,					lowerCamelCase:							bool = False  ,					lowerCamelCase:							str = ascii_uppercase    )       ->      str:


      '''simple docstring'''




      lowerCamelCase__   	=					keyword.upper()
      lowerCamelCase__   	=					plaintext.upper()
      lowerCamelCase__   	=					set(lowerCamelCase    )

      # create a list of unique characters in the keyword - their order matters
      # it determines how we will map plaintext characters to the ciphertext
      lowerCamelCase__   	=					[]
      for char in keyword:
            if char in alphabet_set and char not in unique_chars:
                  unique_chars.append(lowerCamelCase    )
    # the number of those unique characters will determine the number of rows
      lowerCamelCase__   	=					len(lowerCamelCase    )

      # create a shifted version of the alphabet
      lowerCamelCase__   	=					unique_chars + [
          char for char in alphabet if char not in unique_chars
      ]

      # create a modified alphabet by splitting the shifted alphabet into rows
      lowerCamelCase__   	=					[
          shifted_alphabet[k : k + num_unique_chars_in_keyword]
          for k in range(0  ,					26  ,					lowerCamelCase    )
      ]

      # map the alphabet characters to the modified alphabet characters
      # going 'vertically' through the modified alphabet - consider columns first
      lowerCamelCase__   	=					{}
      lowerCamelCase__   	=					0
      for column in range(lowerCamelCase    ):
            for row in modified_alphabet:
                  # if current row (the last one) is too short, break out of loop
                  if len(lowerCamelCase    ) <= column:
                        break

                  # map current letter to letter in modified alphabet
                  lowerCamelCase__   	=					row[column]
                  letter_index += 1

      if verbose:
            print(lowerCamelCase    )
      # create the encrypted text by mapping the plaintext to the modified alphabet
      return "".join(mapping[char] if char in mapping else char for char in plaintext    )


if __name__ == "__main__":
      # example use
      print(mixed_keyword("""college""", """UNIVERSITY"""))