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:
[[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

Ex Output:
[82, -53, 34, 100, 65, 57, 65, 58, -101]


Ex Input:
[[51, 47, -114, -73, -56, -31], [-83, -6, -106, -167, -62, -150], [-116, 49, -75, -188, -21, 53, -198]]

Ex Output:

[51, -6, 53]