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.
18, 19, ['S', 'x', 'o', 'Q', 'f', '2193', '3047', '6529', '4699', 'a', 'q', 'P', 'i', 'H', '1003', 'E', '2331', 'R', '6041', '4493', '7785', '3461', '3603']