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.

14, 15, ['Q', '2131', 'X', 'u', 'y', '9699', '7305', '3017', '8151', 'X', '9723', '7907', 'j', '1527', 'u', 'D', 'b', '7735', '1713']
1527

2, 22, ['Y', '203', 'i', 'b', '2019', '7785', 'u', '9161', 'k', '6543', 'h', '5221', 'Z', 'i', 'B', '4521', 'I', 'Z', '4959', '8841', 'd', 'p', 'i', 'R', 's', '7297', 'y']
49253

5, 10, ['w', 'Q', '1825', 'L', '5933', 'H', '341', '1085', 'K', 'E', '2711']

7359