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]: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']
[EX A]: 6095

[EX Q]: 2, 2, ['M', 'I', 'G', '3747']
[EX A]: 0

[EX Q]: 6, 9, ['6167', '2931', 'i', 'k', 'Q', '4983', '3397', 'K', '8645']
[EX A]:
17025