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.

Example Input: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']
Example Output: 11266

Example Input: 6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']
Example Output: 0

Example Input: 9, 12, ['8613', '7351', 'C', '2455', '5813', '3189', 'O', '4255', 'J', 'd', 'I', '6391', '8989', 'c', 't', '8519', '6889', '1321']
Example Output:
6391