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.

Q: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']

A: 20863
****
Q: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

A: 203
****
Q: 5, 7, ['b', 'u', '5205', '4045', '3099', 'Z', '5115', 'X', '743', '2451', 's', 'd', 'z', 'o', 'P', '3621', '2229', 'R', '1853']

A:
8214
****