If A and B are vertices of a polyhedron, define the distance d(A, B) to be the minimum number of edges of the polyhedron one must traverse in order to connect A and B. For example, if \overline{A B} is an edge of the polyhedron, then d(A, B)=1, but if \overline{A C} and \overline{C B} are edges and \overline{A B} is not an edge, then d(A, B)=2. Let Q, R, and S be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that d(Q, R)>d(R, S)?

**Answer Choices**

A. \dfrac{7}{22}

B. \dfrac{1}{3}

C. \dfrac{3}{8}

D. \dfrac{5}{12}

E. \dfrac{1}{2}