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.
11, 16, ['7325', 'U', 'N', 'Z', '7413', '4579', 'q', '5791', '2933', '7529', '4235', 'N', 'S', 'm', '2223', '8011', 'K', '9389']