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]: 3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']
[A]: 6171


[Q]: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
[A]: 39464


[Q]: 1, 2, ['5147', 'b', '6133', '165', 'n']
[A]:
5147