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: 12, 23, ['A', 'i', '4191', 'B', '2297', '3959', '1125', 'c', '739', '7887', 'p', '8173', '5301', '1969', '9737', '7011', '9845', 'r', '2977', 'z', 'Q', 'N', '3847', 's', 'D', '3391', 'T']

Answer: 48860


Question: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Answer: 45165


Question: 6, 9, ['7247', 'H', '2723', 'i', 'j', 'd', '7975', '3807', 'k', '1975']

Answer:
11782