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, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
19532

3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
20895

3, 14, ['C', 'Q', '7921', '1551', 'u', 'n', '7639', '4773', 'j', 'J', 'l', '4349', '8369', '2525', 'a', 't', '7401', 'r', '1693', 'q', '2891', '825', '2949', '6093', '6067', '2699', 'n', '8143', '6953', '993']

37127