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: 7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']

Output: 12073


Input: Consider Input: 2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']

Output: 47279


Input: Consider Input: 6, 9, ['T', '2991', 'e', 'B', 'p', '8043', '907', '9299', '557', '1865', 'g', '9311']


Output: 18806