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.
5, 21, ['m', 'b', '1757', 'p', 'f', 'y', '4603', 'u', '7849', 'M', 'G', '8761', '2047', '4007', '6071', '3499', '2297', 'Q', '5085', 'S', '5383', 'i', 'F', '3607', '9037']