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.

[[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
[55, 51, 83, 61, -9, 67, 15]

[[-188, 39, -44, -107, -22, 98, -9], [84, 6, -2, -157]]
[98, 84]

[[-45, 95, -110, -104, 49], [-47, -23, -119, 90, -195, -161], [-11, -68, -168], [90, -9, -56, -71, -9], [-140, -152, 41, -116, -6, -118], [23, 7], [-52, -20, 77, -75, -150, -74]]

[95, 90, -11, 90, 41, 23, 77]