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.
[[19, 50, 19, -10, 17, -81, -42], [-140, 24, 16, 13], [-28, -49, -121], [-45, -70, -26, 74, 55], [-175, -167, -22], [94, -113, -93, 22, -27], [92, -180, -64, 35], [-116, -97, -143, -169, -104, 85, 7], [-11, 95, -41, -84, -140, -158]]