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, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']
[A]: 471


[Q]: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']
[A]: 9892


[Q]: 15, 24, ['d', 'l', 's', '6669', '9563', 'Z', 'i', 'd', 'l', '3053', '4253', '5115', 'C', '9243', '845', '489', '2953', '6189', '9599', 'r', '4695', 's', '9843', 'u', 'h']
[A]:
34613