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.
13, 25, ['j', '7927', '9075', 'z', '3263', 'j', '3427', 'd', '107', '6529', 'f', '5473', 'V', '9365', '4007', '1161', 'F', 'k', '1279', 'X', 'c', 'L', '201', '535', 'T']