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, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']
[A]: 16204


[Q]: 1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']
[A]: 13884


[Q]: 2, 27, ['r', '1355', '3589', 'N', '4135', '1343', 'k', '3381', '2759', 'q', 'P', '3689', '553', 'd', '4649', 'r', '8465', 'E', '661', '5337', '8275', 'w', '533', 'j', '5351', 'e', '3279']
[A]:
57354