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]: 6, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']
[A]: 20401


[Q]: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']
[A]: 51416


[Q]: 7, 17, ['1371', 'U', 'c', '3563', '5631', '1799', 'I', 's', '4377', 'l', 'h', 'J', 'L', '6543', '9681', 'l', 'G', 'u', '2765', '3647', '7425', '8861', 'y', '9963', '4535']
[A]:
20601