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.

Q: 1, 2, ['4857', '6373']

A: 11230
****
Q: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']

A: 0
****
Q: 7, 19, ['4261', 'o', '83', 'v', '9731', 'S', '3271', '5871', 'd', 'z', 'D', 'U', 'k', 'u', 'p', 'h', '1081', '7943', 'm']

A:
18166
****