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.
[[-196, 52, 86, 53, -6, -99], [46, -19, -56, -6, 3, 91], [-139, 17, -39], [-145, -173, -71, 48, -152, 13], [66, 39, -131, -157, 42, -77, 84], [-127, -95, -15, 94, 29], [35, -26, -11, 56], [-142, 68, -153], [98, -87, -62, 87]]