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.

[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]
[33, 34, 68, -13]

[[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]
[-42, 30, 87, 34]

[[-200, 64], [-182, -117], [-116, -85, -115, -95, -199], [66, -153, -163, 100], [5, -31, -122, -105, -120, -4], [-133, -48, 17, 96, 46, -154, -132], [78, -106, -25], [-70, -159, -65, -139]]

[64, -117, -85, 100, 5, 96, 78, -65]