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, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

Output: 3201


Input: Consider Input: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']

Output: 15061


Input: Consider Input: 10, 18, ['5021', 'n', '9663', '4345', '4639', '2851', 'X', '2335', '1869', '6577', 'C', '4079', '809', 'v', 'h', 'Q', '8075', 'e', 'I', '4799', '5535', '3857', 'j']


Output: 19540