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.
11, 20, ['P', 'p', 'y', '9019', '5805', '3363', 'c', '753', '387', 's', '1071', 'd', '211', 'Q', '3593', '3245', '6261', '9533', 'x', '5941', '7219', 'a', 'c', '5121', '5257']