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.

[[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]
[-65, 43, 97]

[[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
[21, -38, 99, 89, 40, 46, 69]

[[-54, -23, -24], [-191, -189, 63], [50, -21]]

[-23, 63, 50]