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: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

A: 5573
****
Q: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']

A: 18114
****
Q: 3, 4, ['9319', '5223', '1061', '2937', 'Z', '8011', 'a', '5655', '1465', '4809', '6139', 'o', 'w', '1349']

A:
3998
****