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]: 8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
[EX A]: 3932

[EX Q]: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
[EX A]: 23119

[EX Q]: 2, 3, ['y', 'd', '4739', 'L', '9955', 'T']
[EX A]:
4739