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: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']
Example Output: 11880

Example Input: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
Example Output: 59155

Example Input: 5, 17, ['U', '2275', '9965', '3311', 'J', '4417', 'S', 'O', '9863', '2739', '5449', '713', 'S', 'z', '1741', '949', 'X']
Example Output:
25871