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: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Output: 22632


Input: Consider Input: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']

Output: 123


Input: Consider Input: 12, 13, ['8731', 'P', 'S', '2905', '929', '2239', 'a', '353', 'z', '6987', 's', 'S', '4459', 'y']


Output: 4459