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.

[[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
[79, -33, 2, 42, 81, -142, 71]

[[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[65, 67, 98, 47, 76, -16, 91, 64]

[[-65, -171, 54, -134, -200, 79], [-132, 13, -4, -100], [-114, -24, -47], [59, -146, -16], [-86, -195, -74], [10, -125, 12, -123]]

[79, 13, -24, 59, -74, 12]