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]: 3, 4, ['1809', '1127', 'm', '3137']
[EX A]: 3137

[EX Q]: 1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']
[EX A]: 33437

[EX Q]: 1, 12, ['9457', '6725', 'N', 'M', '8703', 'L', '4107', '3841', '6053', '3927', 'n', '8727', 'c', 'Z', '5037', '9537', '127', 'Q', '5039', 'F', 'u', '9839', 'T']
[EX A]:
51540