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: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']
Example Output: 9892

Example Input: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']
Example Output: 36593

Example Input: 5, 7, ['I', 'Q', 'Y', 'u', 'K', 'c', '5929', 'h', 'B']
Example Output:
5929