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]: 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]: 4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
[A]: 439


[Q]: 11, 18, ['V', 'C', 'O', 's', '2553', 's', '2731', 'Q', '8869', 'Q', '3701', '5671', '5751', 'h', 'O', 'g', '8863', '6213', 'Q', 'y', '6239']
[A]:
30199