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]: 4, 25, ['5003', '1565', '5397', '415', '6045', '9119', '3383', '5449', 'v', 'C', 'J', 'w', '7791', 'F', 'O', '8827', '7171', '2709', 'f', 'W', 'P', '5175', 'D', '135', 'W', '7021', 'T', 's', '7949']
[EX A]: 56219

[EX Q]: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
[EX A]: 0

[EX Q]: 1, 8, ['O', '6161', '1449', '5113', 's', 'm', 'k', 'c', 'e', 'l', 'f', 'F', 'w', 'g', 'N', 'w', '5859', 'T', '8215', '6087', '8251', '4475', '2133', '6353', 't', 'T', '4169', 's', '4863']
[EX A]:
12723