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:
[[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]

Ex Output:
[57, -17, 58, 53, 51, 88, 25, 61, 73]


Ex Input:
[[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Ex Output:
[45, 33, 26, 69, 89, 95, 57, -4]


Ex Input:
[[12, -90], [-195, 10, 21, -111], [-189, -35, -51], [38, 4]]

Ex Output:

[12, 21, -35, 38]