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, 16, ['5819', 'p', '3501', '4013', 'E', 'C', '9103', '4399', '8635', '6109', 's', 'j', '3457', 'J', '8077', '6897']