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.

[[11, 10, -180, -124, -192, 98], [86, -172, -162]]
[98, 86]

[[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
[77, -137, 76, 92, 89, 61, -126, 98, 62]

[[54, -55, -160, 94, -167], [34, -197], [-94, -103, -48, -146, 78, 75, 8], [-138, -63, -96], [-127, -142], [-156, -36, 59, -22], [-37, -38, -52, 15, 44], [-122, -85, 43, -119]]

[94, 34, 78, -63, -127, 59, 44, 43]