Consider the set S={0,1,2,3,⋯,9}. Let m denotes the number of ways the two numbers a,b with replacement chosen from S such that |a−b| >6 and n denotes the number of 10 digit numbers that can be formed using each and every digit of S, which are divisible by 2 but not by 3, then which of the following is/are correct?