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, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[A]: 28546


[Q]: 2, 3, ['o', 'p', '4765', 'u', '629', 'p']
[A]: 4765


[Q]: 3, 8, ['V', 'G', '8275', '5945', '2603', '4023', '6215', 'V', 'v', '3539', 'e', 'V', 'd', '3097', 'N', 'G', 'm', '3391', '9155', 'X', 'T', '5575', 'F', 'G', 'L', 't', '2191', 'y']
[A]:
27061