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.
[[5, -191, -115, -140, -129, -16, -49], [-30, 44, 15, 12, -93], [8, -164, -154, 31, -139, 64, -47], [-59, 77, -56, -46, -75], [91, -127, -46, -20, -47], [-34, -189, -144, -151, 78], [-13, -196, -149, 96, 13, 18]]