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.
[[7, -62, 39], [-69, -80, -38, -5, -48, -108, -55], [38, -173, 73, 50, -173, -106, -148], [-182, -14, -117, -25], [-120, -74, 32], [83, -20, -137, 28, 84, 95], [-105, -103, -143, -40], [-191, 40, -61, -84, 76, 33], [99, -6, 38, 40, -130, -58, 98]]