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.

[[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]
[14, -43, -3, 14, 56, 61, -19, 97, -14]

[[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[83, 59, 65, 56, 83, 99, 98, 15, 82]

[[62, -65, -90, -57, -32, -72], [11, -37, -7, -157, -153], [13, -190, 45], [61, 42, -106, 14, -70, -107], [-6, -78, 93], [40, 79, 97, 4, -73, -70, 65]]

[62, 11, 45, 61, 93, 97]