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:
[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

Ex Output:
[41, -44, 34, 86, 26]


Ex Input:
[[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]

Ex Output:
[-48, 37, 78, 94, -119, 79, 43, 49, 99]


Ex Input:
[[99, 18, -1, -143], [98, 96, -133, 60], [-42, -3, -151, -60, 43, 28, -104], [-66, -19, 33, -105, -177, -124]]

Ex Output:

[99, 98, 43, 33]