If \(\frac{2^m}{n!}\) = \(\sum_{r=0}^2 \frac{1}{(2 r+1)!(11-2 r)!}\), then the number of ways of selecting two numbers from the set {1, 2, 3, ....., 12} whose sum is divisible by 3 is