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]: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
[A]: 36328


[Q]: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']
[A]: 0


[Q]: 2, 3, ['997', 'M', '5431', 'f', 'f', '2593', 'x', 'P']
[A]:
5431