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: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']

Output: 28431


Input: Consider Input: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']

Output: 7057


Input: Consider Input: 3, 10, ['q', 'Y', '5905', 'r', '6861', 'z', 'r', 'P', 'L', '4281', '7977', '6769', 'B', 'A', '2669', '4645', '731', 'J', '9561', '9821', '477', 'g', '3783', '3197', '7605', '3199', '8231', 'f', '3965']


Output: 17047