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: 10, 14, ['u', 'o', 'V', '8223', '365', 'u', '8971', '4209', 'E', 'I', '3385', '5521', '1329', 'b', 'C', '5707', '1807', '2859', '7443', '8141', 'u', '6269', '5781', 'T', 'N', 'R', 'C']

A: 10235
****
Q: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']

A: 8807
****
Q: 1, 8, ['o', 'K', 'w', 'p', 'N', '4585', '4815', '6789', '7589']

A:
16189
****