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: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']

A: 16811
****
Q: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']

A: 12702
****
Q: 10, 11, ['4591', '6663', 't', 'R', 'v', '8881', '6883', '1453', 'L', 'c', '7593', '7307', '5613', '5599', '2139', 'R', '4077', '1063', 'X', 'S', '7131', '4701', 'q', 'k', 'q']

A:
7593
****