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, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']

Output: 6171


Input: Consider Input: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

Output: 8357


Input: Consider Input: 23, 27, ['3789', 'p', '6051', 'K', 'N', 'c', 't', '6921', 'D', '3133', '6883', 'x', 'a', '1447', '1631', '9011', '9007', '569', '9293', 'a', '1217', 'p', 'b', '9175', 'K', 'j', 'D', '6653']


Output: 9175