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: 22, 25, ['681', '2393', 'f', 'g', '5051', '5839', 'T', 'p', '8057', '6929', 'N', '1519', 'G', '8969', '8589', 'T', 't', '4915', 'r', 'M', 'N', '8285', '8607', '4333', '7457', '343', 'f', 'r']
Example Output: 28682

Example Input: 1, 2, ['2333', '6101']
Example Output: 8434

Example Input: 3, 15, ['935', '8015', '1843', 'h', 'b', 'x', '6513', '6207', '7571', 'J', '1673', '4831', 'b', 'F', '3703', '4179', '1227', 'F', 'f', 'u', 'R', 'K', '2259', '8017', '9745']
Example Output:
32341