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.

Example Input: 3, 5, ['i', 'e', '6583', '313', '5511']
Example Output: 12407

Example Input: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']
Example Output: 10495

Example Input: 9, 17, ['a', '9835', 'P', 'U', '215', '2847', 'v', '5321', 'x', '8447', 'G', 'T', '9501', 'd', 'b', '2389', '971', '5505', 'I', '9293', 'G', '5965', 'p', '5057', '3915']
Example Output:
21308