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: 16, 29, ['1431', 'a', '7223', '5743', '4571', 'q', 'Z', '3415', '6237', '1537', '5403', 'Y', 'K', '1949', 'p', '2641', '3307', 'X', 'O', 'q', 'T', 'n', '845', '1489', '161', '8515', '8735', '5065', '4973', '9287']
Example Output: 35731

Example Input: 2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']
Example Output: 47279

Example Input: 3, 24, ['x', 'i', '3285', 'm', '8179', 'm', 'e', 'p', '2305', 'c', '701', '5011', 'c', '1955', '6921', 'c', 'X', 'M', 'W', 'p', '6109', 'N', 'g', 'E', 'm', '6099']
Example Output:
34466