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, ['H', 'L', 'W', '1825', 'c', '6805', 'o', 'R', 'M', '1641', 'z', '6731', 'O', 'd', '5131', 'z', 'n', '6401', 'A', '7601', '4311', '5569', '5819', 'E']