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.
12, 23, ['1239', 'q', '9817', 'w', '5179', '9445', 'f', 'N', 'B', '1255', '1401', 'X', 'j', 'F', 'z', '8493', 'y', '7759', 'N', '3205', '5209', 'z', '4731', '7519', '6367', 'x', '8253']