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: 7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']

Output: 8414


Input: Consider Input: 2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']

Output: 36626


Input: Consider Input: 2, 8, ['1725', 'u', '4407', '5365', 'P', '1547', '8353', 'Q']


Output: 19672