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: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']
Example Output: 0

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: 6, 9, ['k', 'J', '5571', 'Q', 't', 'R', '1939', 'Q', 'b', '3943', '2591', 'a', '277', 'y', 'K', '5171', 'H', 'q', 'h', 'w', 'S', 'c', '4901', 'u', '7027', '7721', '5983']
Example Output:
1939