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.
10, 10, ['699', '5545', '963', 'n', '3237', 'K', '8325', 'm', '9921', '6133', '1303', 'W', 'N', '9541', '759', 'u', '8905', 'P', '6025', 'd', 'M']