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: 7, 12, ['8785', '221', 'f', 'f', '5743', '4839', '9389', '4759', '1493', 'a', '4951', 'K', '8501', '3331', '2069', '2713', 'j', '7557', 'p', '7679', 'S', '6499', 'E', '439', 't', 'P', 'i', 'u', '8401', 'o']

Output: 20592


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: 3, 12, ['H', '1629', '917', '7907', 'v', '9481', 'W', 'J', 'f', 'F', 'U', 'q']


Output: 18305