Definition: 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: 7, 9, ['7369', '7913', 'x', 'D', 'A', 'w', 'B', '3787', 'E', '259', 'i', '2273', '9399', 'a', '3965', 'H', '1157', '7221', '6039', 'n', 'N', '4561', '5187', '9429', 'E', 'y', '1933', '1349', '8641', 'u']

3787