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: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
Example Output: 26847

Example Input: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
Example Output: 59155

Example Input: 14, 23, ['n', 'j', '5209', 's', '6885', '8815', 'x', '6505', 'A', '9065', 'Y', '1545', '8011', '8011', '4585', 'd', 'x', 'S', '6981', '9611', '6311', 'u', '5255', 'H', 'o', 'C', '1687', '8515']
Example Output:
40754