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, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
[A]: 20324


[Q]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[A]: 0


[Q]: 25, 27, ['6411', '2467', 'y', '4973', 'C', '8853', 'H', 'G', 'a', 'N', '3759', '7803', '5403', 'Z', '4047', '6283', 'v', '5437', 'p', 't', 'S', '7605', 's', 'Z', '7537', 'Y', 'U', 'W', '2147', 'K']
[A]:
7537