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: 12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']

Output: 8625


Input: Consider Input: 1, 2, ['7321', '6233']

Output: 13554


Input: Consider Input: 11, 15, ['4521', 't', 'C', '7173', 'k', '9647', '2335', '2923', '469', 'B', '1439', '4979', 'h', 'n', '5759', 'D']


Output: 12177