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, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']

Output: 5738


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: 7, 26, ['1105', '107', 'q', '205', 'a', 'O', '5915', 'E', 'w', '9223', 'L', '3235', 'M', '1567', '9375', 'j', '7011', '6611', '1869', 'w', 'Z', 'S', 'H', '9511', '3493', 'c', '3971', '8211']


Output: 57810