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: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']

A: 21080
****
Q: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']

A: 19785
****
Q: 1, 14, ['3603', '2285', '9101', 'i', '4659', 'C', '4171', '6751', 'a', 'V', 't', '1947', '881', 'F', '4875', '4343', 'T', '3095', '6603', 'g', 'C', '9107', '5045', '7289', 'z']

A:
33398
****