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.
2, 10, ['5467', '4579', 'W', 'y', '677', 'k', 'W', '7535', '3519', '1441', 'o', 'L', '3669', 'b', '6611', '9877', '8623', 'w', 'u', 'a', '1557', '1409', '5191']