instruction:
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.
question:
[[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]
answer:
[44, 72, 91, 14, 85, 99, 81]


question:
[[-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]]
answer:
[71, 44, 78, 87, 68, 91]


question:
[[-8, -189, -115, -48, -174, -109, -38], [28, -161, 28, -111, 85, 81], [83, -134, -49, 70, -116], [-69, -66, -43, -161], [-12, -19, 47, 88, -133, -178], [-116, 89, -117, -36, -101], [-119, 82, 37, 81, -36], [-114, -109], [-76, -121, 7, -170, -39, 51]]
answer:

[-8, 85, 83, -43, 88, 89, 82, -109, 51]