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.

[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
[71, 44, 78, 87, 68, 91]

[[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]
[39, 94, -9, 23, 53, 92, 72, 15, 38]

[[-180, -178, -112, -138], [-67, 17, -43, -103, -85, -174, 13], [-40, -69, -159], [31, -65, 46, -91, -84], [-69, -151], [-26, -42, -28], [-92, -39, 89, -137]]

[-112, 17, -40, 46, -69, -26, 89]