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]: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
[A]: 39464


[Q]: 9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']
[A]: 25185


[Q]: 12, 17, ['L', '6665', 'G', 'Q', 'x', '9031', 'D', '1951', 'M', 'n', '3211', 'F', 'n', 'v', 'q', '6237', '4303', '2709', 'C', 'r']
[A]:
10540