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, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']

A: 22848
****
Q: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

A: 4477
****
Q: 7, 10, ['59', 'Y', '3539', '8783', '4823', 'f', 'v', '6303', 'N', 'y', 'Y', 'f', '579', '3823', '1495', 'a', '215', 'p', '6695', 'l', '2667']

A:
6303
****