In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[66, 53, -12, -182, -159], [-25, 33, 13, -153], [-129, -97, -152, -196, -62, 73], [-72, -161, -106, 32, 52], [-62, -161, 16, -93, -78, -60, -144], [-69, 62]]