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: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
Example Output: 6933

Example Input: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']
Example Output: 3201

Example Input: 8, 14, ['4375', '3833', 'W', 'e', 'P', '7739', '7825', '6725', '2935', 'O', 'L', 'J', 'w', 'r']
Example Output:
9660