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, 17, ['o', '9593', 'd', '6831', 'f', '347', 'A', '3913', 'g', '361', 'd', '8529', 'e', 'Q', '3021', 'r', '2485', 'F', 'u', '6437', '9851']