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.
8, 22, ['593', '5911', 'r', 'z', 'Q', 'K', '7301', 'J', '973', '3891', 'c', '7119', 'D', 's', '3423', '4383', 'c', 'A', 's', '7307', '5825', 'k']