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]: 1, 3, ['p', '5665', '3001']
[A]: 8666


[Q]: 15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']
[A]: 40552


[Q]: 12, 16, ['3347', '1193', 'x', 'H', '7913', 'I', 'r', 'F', 'Z', 'v', '5103', 'e', 'D', '6453', 'a', '6769', '223', '2509', 'W', 'c', '789', '2223', 'Y', 'i', '7987', 'A', '6823']
[A]:
13222