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.

1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']
0

2, 16, ['2169', 'o', 'D', '8877', '3351', 'p', 'X', '1143', '9633', 'f', '2507', 'S', '5541', 'B', '4543', 'A', 'f']
35595

7, 9, ['8813', '5621', 'F', 'K', '3717', '3363', '3215', '7093', '797', 'V', 'B']

11105