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, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']
26373

1, 2, ['2333', '6101']
8434

13, 23, ['u', '9785', 'b', 'P', 'u', '4387', '3299', 'y', 'j', '1217', '7017', '8603', '4615', '3199', '8925', '4467', '5003', 'o', 'n', '5311', 'O', 'X', '7285', '7601', '2747']

38805