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: 6, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']
Example Output: 5738

Example Input: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
Example Output: 17103

Example Input: 10, 11, ['8283', '5123', 'M', 'z', 'E', '4347', 'K', '2685', '1295', '2563', '5019', 'M', 'u', '2021', 'P', 'v', 'v']
Example Output:
7582