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]: 2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']
[EX A]: 9829

[EX Q]: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']
[EX A]: 10387

[EX Q]: 6, 10, ['8349', '1681', '2907', '1947', 'i', 'd', 't', 'Z', '9445', 'L']
[EX A]:
9445