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, 3, ['x', '971', '3029']
Example Output: 4000

Example Input: 14, 26, ['U', 'D', '5391', '2975', 'b', 'b', '8741', '8991', '9083', '5401', '481', 'q', 'j', '8757', 'C', '2027', '6683', '5667', 'R', '631', 'm', '3743', '9769', '1039', '923', 'Q', '4373', '7451']
Example Output: 39239

Example Input: 4, 11, ['845', '9051', '1281', 'V', 'N', '7879', 'X', '8873', 'Q', 'T', 'k', 'n', '5635', '5583', '1741', 'g', '6149', '5437', 'Q', 'j', 'K', '3367', '2875']
Example Output:
16752