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: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']

A: 12852
****
Q: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']

A: 17739
****
Q: 14, 16, ['933', 'h', 'X', '4663', '5397', '5061', '7291', 'M', '4067', '5477', '3807', '8049', 'o', '295', '3515', 'j', 'y', '1033', 'q', 'o', 'Z', '8461']

A:
3810
****