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.

[[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]
[2, 72, 60]

[[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]
[-84, 64, 62, -1, 88, -71]

[[-26, 56, 41, 60, -60, 72], [-15, -86, 9, -168], [29, -92, 84, -180, -134, -39], [7, 38, -198, -158], [10, 65]]

[72, 9, 84, 38, 65]