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: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Output: 18160


Input: Consider Input: 9, 16, ['u', '81', '19', '5877', 'F', '6479', 'v', '4187', 'M', 'a', '4309', 'z', 'u', '55', 'w', 'W', '7471', 'b', 'k', 'W', '8785', 'y', 'n', 'q', 'G']

Output: 4364


Input: Consider Input: 13, 19, ['Y', 't', 'o', 'n', '5121', 'v', 'R', 'Z', '9233', '1947', '5201', 'U', 'V', 'E', 'h', '8909', 'B', 'q', 'Z', '9931', '8725', 'e', 'e', 'O', '3367', '4523', 'Z', 'c']


Output: 8909