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.
13, 14, ['Y', 'i', 'K', 'n', '9679', '1077', '9673', 'k', '8433', '1065', '9905', 'v', '9075', 'd', '3329', '4397', 'x', 'C']