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.

11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
6609

6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']
0

1, 12, ['291', 'R', '6525', '4375', '5767', 'I', 'X', '4709', 'R', '5685', '5783', '1257', 'Z', '431']

34392