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.
5, 13, ['3709', 'k', 'm', '7335', '4499', 'W', '3647', '4545', 'k', 'l', 'B', '3007', 'E', '6387', 'T', '5077', '5693', 'v', '4707', '1865', 'n', 'I']