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, ['4845', '7313', 'P', 'A', '2285', 'C', 't']
[A]: 0


[Q]: 10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']
[A]: 8988


[Q]: 3, 13, ['3391', '41', '9419', '3499', '3489', '7229', '3173', 'O', '5983', 'Y', '1999', 'N', 'n', 'Z', 'p']
[A]:
34791