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.

3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
9392

9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
12942

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']

10235