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: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']

A: 6609
****
Q: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']

A: 5121
****
Q: 13, 28, ['N', 'G', '7807', 'p', '345', '4965', '1957', 'i', 'E', 'g', 'E', 't', '3871', 'N', '1551', '8849', '4901', '1961', '7879', '1645', '6105', 'K', '4569', '2591', 'X', 'W', 'D', 'P', 'G', 'g']

A:
43922
****