Did the grandfather gather it or not?

The well-known toy, the "Rubik's Cube," consists of smaller cubes, as shown in Figure $1a$, where letters indicate colors (for example, B for blue, R for red, and so on). The goal of the game is to rotate the faces so that, in the end, each face has the same, but its own, unique color, as illustrated. Note that when a face is rotated, the color configuration changes on all neighboring faces. Figure $2$ demonstrates the rotation of one of the faces.

Your grandfather, who has many years of experience, claims that for any Rubik's Cube configuration, he can devise a sequence of rotations to bring it to the solved state. In order to show all faces of the cube, we will display it as in Figure $3a$. The six colors are always yellow (Y), red (R), blue (B), green (G), white (W), and purple (M), denoted by their first letters in English.

You are given the initial configuration of the cube and a sequence of rotations. Each rotation is given by an integer indicating the face that is rotated and the direction of rotation (a positive number means rotation clockwise, a negative number means rotation counterclockwise). The faces of the cube are numbered as in Figure $3b$. Write a program that checks whether the given sequence of rotations leads the cube to the solved state.