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: 18, 24, ['3493', 'T', '2499', 'l', '543', 'Y', '2247', '2665', 'y', 'z', 'a', 'H', '1057', '2401', '5587', 'w', 'N', 'n', 's', 'H', 'u', 'N', '757', 'u', 'R']

Output: 757


Input: Consider Input: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']

Output: 0


Input: Consider Input: 1, 7, ['7899', 'L', 'u', '3701', '263', '5451', 'a', 'v']


Output: 17314