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:
[[-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:
[[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

Ex Output:
[-61, -151, 63, -48, 2, 66]


Ex Input:
[[-100, -44, -191, -77, 93, -169], [-78, -93, -39], [77, -1], [-2, 59, -101, 57, -184, -96, -28], [23, 66, 67, -106, -161], [-105, 14, 6, -18], [-176, 32], [-91, -18]]

Ex Output:

[93, -39, 77, 59, 67, 14, 32, -18]