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: 6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']

Output: 17352


Input: Consider Input: 12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']

Output: 22751


Input: Consider Input: 10, 24, ['7347', 'Q', 'm', 'M', '3925', '8815', 'i', 'F', 'v', '907', '4733', '1395', '5125', 'A', 'v', 'C', 'V', 'U', 'j', '4245', '6677', 'h', 'V', '9773', '6239', 'H', 'p', 'k', '1675']


Output: 32855