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.

Input: Consider Input: 4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']

Output: 12203


Input: Consider Input: 2, 2, ['8149', '7123', 'c', 'X', '1659']

Output: 7123


Input: Consider Input: 2, 2, ['i', '2215', '2205', 'd']


Output: 2215