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.

[[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[76, -40, 87, 30, 27, 27, 51]

[[-19, -151], [33, 54, 85]]
[-19, 85]

[[15, -9, 29], [-56, 48, 5, -143, -142, -89, -143], [10, 70, -134]]

[29, 48, 70]