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:
[[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

Ex Output:
[59, -12, -25]


Ex Input:
[[-148, -62, -116], [-197, -116, 68, -86, -125, 12, 73], [98, -171, -193, -34], [-187, -2, -47, -103, -138, 17], [-169, -109, 45, 59, -191, 54, -177], [-176, -190, -87]]

Ex Output:

[-62, 73, 98, 17, 59, -87]