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.

Input: Consider Input: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

Output: 15701


Input: Consider Input: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']

Output: 9466


Input: Consider Input: 7, 12, ['C', '7921', 'r', '3093', '1917', '6641', 'T', '5385', '6165', 'S', 'l', 'Z', 't', '9875', '2851', 'I', 'H', 'o', '7917', '6783', '5091', '5757', 'M', 'q']


Output: 11550