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.
1, 3, ['N', 'S', '8185', 'Q', 'z', '1503', 'k', 'H', '6891', 'e', '1699', 'P', '1011', '3215', '5791', '9577', 'r', '6739', '1637', 'c', '8547', '2327', '1499', '1651', 's', '9083', '7701']