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.
--------
Question: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']

Answer: 47509


Question: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']

Answer: 9466


Question: 2, 10, ['2123', '2125', 'c', '7979', 'd', '1997', 'p', 'T', '5881', '2341', '7263']

Answer:
20323