In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
15, 16, ['F', '5415', 'R', 'u', '9899', 'd', '1625', '4655', 'b', 'L', '277', '6545', 'K', 'd', 'K', '8363', '1643', '8989', '4787', 'B', 'L', 'e', 'J', '5063', '8589', '3255', 'I', 'H', 'M']