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.
3, 17, ['d', '9499', 'P', 'I', 't', 'r', '6861', '9465', '7821', 'Y', '701', 'V', '8491', 'R', '6215', '2865', '6291', 'I', '7703', 'Y']