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.
[[-104, -35, -12], [-145, -148], [-126, 77, 32, 47, -67, 44, -109], [-113, -114, 39, 1], [-51, -178, 4, -104], [93, -159], [10, -76, -4, -69, -147, -179, -85], [-43, -69, 36, -2, -72, 53, -136], [-85, -40, -120, -20, -12, 90]]