

from string import ascii_uppercase



def   UpperCamelCase(   lowercase_     ,   lowercase_     ,   lowercase_ = False     ,   lowercase_ = ascii_uppercase				)      ->							str:





  '''simple docstring'''





  snake_case_					= keyword.upper()
  snake_case_					= plaintext.upper()
  snake_case_					= set(lowercase_				)

  # 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(lowercase_				)
    # the number of those unique characters will determine the number of rows
  snake_case_					= len(lowercase_				)

  # 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     ,   26     ,   lowercase_				)
  ]

  # 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(lowercase_				):
    for row in modified_alphabet:
      # if current row (the last one) is too short, break out of loop
      if len(lowercase_				) <= column:
        break

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

  if verbose:
    print(lowercase_				)
  # 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'''))


def   UpperCamelCase(   lowercase_ = 100     ,   lowercase_ = 100				)      ->							int:





  '''simple docstring'''





  return max(
      sum(int(lowercase_				) for x in str(base**power				)				)
      for base in range(lowercase_				)
      for power in range(lowercase_				)				)


# Tests
if __name__ == "__main__":
    import doctest

    doctest.testmod()