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.

[[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]
[44, 57, 55, 78, 8, -10, 13]

[[-148, 31, -194, 43, -103, -187, -150], [10, -3, 85, -57], [-102, 39, -179, -125, 49]]
[43, 85, 49]

[[36, -151, -9, -118, 96], [-47, 75, -4], [27, 65, -190, -24, -71, -83], [-40, -81, 79], [90, -95, -55, -49, -10, 61, -51], [11, -32, -189], [-58, 88, 37, 83, -197, -159], [-35, 53, -69, 11, -169]]

[96, 75, 65, 79, 90, 11, 88, 53]