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.

6, 16, ['4469', '9515', 'z', '153', '123', '787', '3795', '1737', '6047', 'l', '165', 'C', 'p', '5221', 'M', '4149', 'L']
21901

1, 2, ['8895', 't', '5739']
8895

2, 20, ['B', 'v', 's', 'j', 'P', 'q', 'k', '3017', 'n', '9337', '2605', '2867', '4709', '9071', 'R', '1439', 'Z', 'T', '7625', '3695', 'r', 'U', 'h', 'T']

44365