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.
15, 17, ['3573', '5065', '2079', '6667', 'n', 'E', '6329', 'c', 'V', 'd', '3207', '5859', '3221', '675', '6563', '8333', 'r']