This is based on the fact that HCF or GCD of (a,a,-b) or (a,-b,b) is the same that of (a,b). This follows from the fact that every mutual factor of a and b are also the factor of a+b and `|a-b|`. And so becomes thr grid. This will happens at each stage of reach for some (a,b),
Thus lion can only reach those points whose gcd or hcf is (8,10) = =2, Therefore the answer is all the coordinates whose hcf is 2,
`{(2,2)}**1`
`{(2,4)(4,6)(6,8)(8,10)(10,12)`
`(2,6)(6,10)`
`(2,8)(4,10)`
`(2,10) (2,12)}**2` (As these could be both a,b and b,a)