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, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
[A]: 123


[Q]: 1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']
[A]: 33437


[Q]: 5, 22, ['K', '7089', '3325', '3451', '793', '8553', 's', 'h', '7911', '465', 'Y', 'h', '7323', '7301', '8425', '379', '4625', '9947', 'Y', '9461', '4909', 'v', 'k', '6863', '2017', 'o', 'B']
[A]:
70092