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.

[[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[60, -32, 68, 93, 24, 26, 7, 85]

[[-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]]
[-48, 37, 78, 94, -119, 79, 43, 49, 99]

[[-192, 72, -188, 32], [0, 36, -68, -190, -173, -34], [-49, 88, 16, -9, -188, -6], [-97, -128, -70, -123, -67], [-123, -97, 57, 8, -26, -32, -94]]

[72, 36, 88, -67, 57]