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.

Ex Input:
2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Ex Output:
18160


Ex Input:
22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']

Ex Output:
7998


Ex Input:
2, 5, ['X', '1857', '1407', 'D', '8247', '6679', 's']

Ex Output:

11511