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.

[EX 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']
[EX A]: 22848

[EX Q]: 1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']
[EX A]: 8063

[EX Q]: 9, 11, ['U', '7327', '7199', '6241', 'r', 'g', 'R', 't', 'a', 'r', 'k', 'l', 'w', '7949']
[EX A]:
0