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.
[[-26, -54], [-116, -106, -74, -178], [-99, -53], [-13, -170, -100, -168], [-59, -42, -74, -90], [-43, -119, -36, 81, -193], [-110, -7, -55, -73, 21, -105]]