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, 18, ['s', 'Q', '8311', '7903', 't', 'S', 'C', 'l', 'V', 'L', 'J', '9811', '3701', 'T', '7413', '667', '1839', 's', 'i', 'L', 'o', 's', 'J']