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: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']

Output: 283


Input: Consider Input: 2, 7, ['E', 'e', '5585', 'g', '4971', '8891', '811', 'l', '527', '4299', 'b', 'N', '5079', 'j', '5555', '4789']

Output: 20258


Input: Consider Input: 22, 27, ['1241', 'B', 'I', '405', 'j', '8759', 'B', '2337', 'x', '3917', '5565', '9779', 'c', 'U', 'a', '6457', 'l', '239', '1311', '8917', 'A', '1593', '5463', '7567', '4751', 'P', '4621', 'W', '5123']


Output: 23995