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, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']

A: 36626
****
Q: 3, 5, ['u', 'Y', '4165', '1421', '7617']

A: 13203
****
Q: 2, 13, ['7903', 'q', 'f', 'N', 'N', 'Y', '9597', 'D', '9231', '7977', 's', '9801', '6153', '2237', '749', 'F', 'I', 'K', '4255', 'i', '631']

A:
42759
****