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: 7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']
Example Output: 12129

Example Input: 1, 4, ['261', '6237', '3809', '1857']
Example Output: 12164

Example Input: 11, 21, ['6265', 'K', '7557', '957', 'q', '459', 'r', '9661', 'K', 'M', 'P', 'c', 'o', 'h', '5275', '9707', '9503', '8753', '1621', 'P', '5485', '3057', 'v', 'O', 'P', '287', '9281', 'm']
Example Output:
40344