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]: 2, 3, ['E', '7611', '2621', '3237']
[A]: 10232


[Q]: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
[A]: 45165


[Q]: 6, 17, ['h', '179', 'B', '4663', '2201', 'R', 'U', '5861', '2923', 'U', '9121', 'b', '3053', 'O', 'n', 'o', 's', 'S', '5077']
[A]:
20958