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]: 9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']
[A]: 2445


[Q]: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
[A]: 0


[Q]: 4, 22, ['f', '6215', '9937', '3177', '3305', '5533', 'a', 'L', 'z', '461', 'K', 'q', 'q', 'f', '4659', '7355', '5725', '1003', '2627', 'f', 'A', '5941', '4843', 'K', 'q', '4583', '6369']
[A]:
39786