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, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Output: 439


Input: Consider Input: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

Output: 14032


Input: Consider Input: 2, 14, ['j', 'U', 'O', '9813', 'j', '7447', '6659', '187', '9891', '7273', 'D', '4537', 'v', 'U', '6221', 'v', '6983', 'p', '2509', 'O', '5971', '9549']


Output: 45807