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:
[[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

Ex Output:
[89, 47, 19, -36]


Ex Input:
[[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

Ex Output:
[60, -36, 94, 68, 36, -64, 41]


Ex Input:
[[-186, -46, -187, 18, -73], [6, 58, 98, -111, 6, 26]]

Ex Output:

[18, 98]