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]: 1, 1, ['d', '6481']
[A]: 0


[Q]: 2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']
[A]: 27506


[Q]: 19, 24, ['K', 'Z', '5197', 'N', 'E', '2077', '3809', 'U', 'b', '2987', 'W', '4071', '979', 'z', 's', 'u', '2497', '5987', 'K', '2393', '9577', '3203', 'S', '8051', 'A']
[A]:
23224