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: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']

A: 51416
****
Q: 5, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']

A: 10531
****
Q: 18, 19, ['5115', 'b', 'B', '9739', '4509', 'D', 'P', 'p', '9235', '9517', '7279', '8703', '8535', '5943', '1527', 'N', 'U', '3099', 'c', '5173', 'V', '3539', '8043', 'l']

A:
3099
****