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.

[[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
[-16, 68, 80, -85, -15, 94, 69]

[[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]
[67, 76, 63, 72]

[[-62, -5, 48, -29, -84, -172, -169], [-40, -168], [83, -99, -48, -10], [-149, 64, -192], [39, -25, -40], [25, -95, -156, -85, -194, 22, 28]]

[48, -40, 83, 64, 39, 28]