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:
[[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]
answer:
[91, 3, 49, 70, 91]


question:
[[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
answer:
[21, 70, 64, 38, 64, -27]


question:
[[66, 53, -12, -182, -159], [-25, 33, 13, -153], [-129, -97, -152, -196, -62, 73], [-72, -161, -106, 32, 52], [-62, -161, 16, -93, -78, -60, -144], [-69, 62]]
answer:

[66, 33, 73, 52, 16, 62]