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, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
[EX A]: 439

[EX Q]: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
[EX A]: 0

[EX Q]: 2, 13, ['u', '1289', 'U', '6717', 'z', 'g', 'L', '2555', '3903', '1921', '671', '8327', 'N', 'd', 'h', '8181']
[EX A]:
25383