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.

[[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]
[11, 41, 90, 72, 34, 56, 91, -133]

[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[-33, 49, 37, -34, 92, 57, 19, 72, -92]

[[-60, -46], [-177, -85, 71, -178], [55, -173, -13], [-46, -67, -74, 92, -113], [80, -130, -55, -28], [-50, -186, -133, -97, -112, -31], [11, 93]]

[-46, 71, 55, 92, 80, -31, 93]