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, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
Example Output: 33375

Example Input: 14, 15, ['Q', '2131', 'X', 'u', 'y', '9699', '7305', '3017', '8151', 'X', '9723', '7907', 'j', '1527', 'u', 'D', 'b', '7735', '1713']
Example Output: 1527

Example Input: 3, 6, ['6175', '8771', 'b', 'N', '1421', 'f', '9779', 'F', '6085', '795', 'p', 'f', 'D', 'X', '8987', '3851', '1161', 'V', '6021', 'D', 'a', '9087', 'S', 'p', 'x', 'B']
Example Output:
1421