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: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']

Output: 7479


Input: Consider Input: 2, 3, ['W', '871', 'F', 'e', '8493', 'R', 'I', 'I']


Output: 871