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.

Ex Input:
[[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]

Ex Output:
[11, 11, 35, 82, 48, 95, 2, 0, -115]


Ex Input:
[[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Ex Output:
[78, 70, 89, 9]


Ex Input:
[[-196, -169, -26, -53, -145, -96, -153], [-126, -169, -70, -41, -28, 52], [-129, -199, -74, 46], [7, -1, -88, 29, -23, 93]]

Ex Output:

[-26, 52, 46, 93]