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.
8, 15, ['W', '6129', '6109', '5385', '2381', 'r', '6653', 'u', 'f', 'g', 't', 'b', 'w', '8501', 'q', 'B', '8075', 'E', 'D', '1691', 'j', '1663', 'q']