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.
[[-139, 82, 68, -105, 66], [34, 75, -107, -89], [-36, -72, -51, -84, -195, -126, 83], [-40, 23, -70, -109, 74], [-35, 27], [-196, 29], [39, -154, 20, -166, 90], [-198, 50, -171, 29, -135, -134, 40], [-100, -130, -113, -28, -5, -178]]