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.

Example Input: 6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']
Example Output: 21901

Example Input: 5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
Example Output: 9466

Example Input: 15, 25, ['8563', '3387', '9151', '5577', '2001', 'O', 'V', 'H', 'g', 'A', '8587', '8165', 'N', 'Z', 'S', 'h', 'f', '8637', '4267', '3501', '9463', 'u', 'r', 'c', 'V', '7589', 'N', '4255', '3787']
Example Output:
25868