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.

[[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]
[75, 34, 96, 33, 21, 50, 17]

[[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]
[82, -35, 37, 86, 1, 46, 99]

[[36, -132, -5, 30], [87, -34, 30, -125, -197], [40, -94, -130, -119, -126, -23, 13], [-135, -154, -62, 43, 69, -127]]

[36, 87, 40, 69]