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: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']

A: 7267
****
Q: 1, 6, ['S', 'i', 'F', 'w', '6345', 'L', '9727', 'u', 'F', '7911', 'K', '3151', '6181', 'N', 'a']

A: 6345
****
Q: 1, 12, ['T', '3255', 'p', '3017', 'i', 'U', '8617', '5137', '77', 'Q', 'j', 'U', 'x', 'S', '2435', '4143', '5091', '7539', 'L', '1371', 'c', '9439', '7103', 'a', '4063', 'J', '933', 'M']

A:
20103
****