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: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

Output: 22725


Input: Consider Input: 1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

Output: 8063


Input: Consider Input: 1, 19, ['r', '1795', '6985', '5509', '3365', 'H', 'q', '5285', 'E', '281', '3869', 'I', '6525', '8367', '9753', '2603', 'v', 'b', '7249', '1833', 'r', 'k', 'g']


Output: 61586