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: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
Example Output: 19516

Example Input: 18, 27, ['1757', 'B', '5165', 'v', 'c', '2699', '9861', '3935', 'p', 'A', '6855', '5233', '1543', 'A', 'H', 'o', 'P', '6749', '2411', 'B', 'U', 'G', '1645', '1543', 'x', '7271', '4383', 'n', '2725', 'n']
Example Output: 24002

Example Input: 6, 10, ['X', '5605', 'x', '4395', '3449', '4951', 'O', '5421', '1779', '6279', '95', '8645', 'b', 'c']
Example Output:
18430