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: 21, 23, ['211', '959', '3183', '1605', '3217', '6793', '2239', 'Z', 'T', 'f', '2559', '9249', 'X', '6925', '4373', 'j', 'H', '9575', '3481', 'W', 'p', 'v', 't', '5995', '8765', '201', 'F', 'O', '7251', 'S']

Output: 0


Input: Consider Input: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']

Output: 123


Input: Consider Input: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']


Output: 11382