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: 9, 11, ['8449', 'j', '8735', '2839', '2773', '1659', 'V', 'I', 'x', 'V', 't', '7837', 'F', 'N', '4179', 'G', 'f', '8193']

Output: 0


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: 10, 10, ['R', '2995', 'q', 'S', 'n', 'e', 'i', '9399', '4081', 'Y', 'l', 'U', '3903', 'g', 'C', 'X', '1103', 'Y', '3179', 'l', '9323', 'X', 'h', 'Q']


Output: 0