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: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']

Output: 17360


Input: Consider Input: 5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Output: 0


Input: Consider Input: 6, 11, ['4237', '9807', 'k', '831', 'N', 'X', '8943', 'G', '1395', 'I', '889', '5697', 'X', '2445', 'r', '1967', '2523', '3527', '9085', 'D', '91', 'S', '5689', 'i', '9273', '991', '523', '9545', '4937']


Output: 11227