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.
17, 20, ['F', '3953', '985', 'M', 'w', '5069', 'z', '5055', '7809', '6923', '5591', '1813', 'm', 'E', 'h', 'D', '1749', '2003', '4077', 'l', 'r', '6475', '7553', 'l']