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:
[[-200, 67], [100, -189, 2, -76, -44, -120], [61, -38, -71], [-105, 50, -71, -145, -107, 43, -1], [-173, -90, 1, -146, -15], [95, -4, 38], [-27, -157, -141, 12, -171, -42], [22, 20, -170, -57], [-148, -178, -12, 92]]

Ex Output:
[67, 100, 61, 50, 1, 95, 12, 22, 92]


Ex Input:
[[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

Ex Output:
[58, 54, 100, 65]


Ex Input:
[[-13, -64], [-157, 90, -26], [-155, 59, 32, 25, -178, 70], [-53, -187], [11, -7, -124, 3, -78, 43, -125], [-145, -102, -83, -146, 62], [-45, -173, -114, -133, 29, -14], [-89, 45], [-97, -18, 14, -148]]

Ex Output:

[-13, 90, 70, -53, 43, 62, 29, 45, 14]