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, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
[A]: 26847


[Q]: 1, 2, ['m', 'E']
[A]: 0


[Q]: 5, 13, ['8539', 'K', '731', 'f', 'R', '6909', '2575', 'U', 'g', 'e', '1901', 'C', 'F', 'Z', 'A', '4119', '2983']
[A]:
11385