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: 14, 15, ['B', 'i', 'F', 'F', '7361', 'U', '6625', 'x', '7875', 'm', '5637', '9533', 'y', 'e', '5049', '3809', '1', '8269', '435', '2363', '1679', 'e', '8775', 'A', 'l', '161']

A: 5049
****
Q: 17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']

A: 14824
****
Q: 17, 20, ['M', '8533', 'k', '9805', '7805', '4715', '9347', 'S', '9449', '1795', 'd', 'Y', '6813', 'g', '4035', 'b', 'Z', 'N', 'Q', '7547', '577', 'y', 'n', 'C', 'u']

A:
7547
****