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: 1, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']
Example Output: 46930

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: 6, 9, ['3253', '2853', 'c', '8245', 'S', 'i', '6899', '3943', '5477', '449', 'X', 'E']
Example Output:
16319