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: 5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
Example Output: 19814

Example Input: 10, 11, ['9135', '2127', '9135', '8643', 'r', 'S', '1705', '5563', 'o', '9497', '5693', 'N', 'x', '8381', '4619', '2851', '917', '4513', 'U', '7667', '1115', '309', 'S', 't', 'q', '3277']
Example Output:
15190