Problem:
Problem E: Beehives

Taro and Hanako, students majoring in biology, have been engaged long in observations of beehives. Their interest is in finding any egg patterns laid by queen bees of a specific wild species. A queen bee is said to lay a batch ofeggs in a short time. Taro and Hanako have never seen queen bees laying eggs. Thus, every time they find beehives, they find eggs just laid in hive cells.

Taro and Hanako have a convention to record an egg layout.. they assume the queen bee lays eggs, moving from one cell to an adjacent cell along a path containing no cycles. They record the path of cells with eggs. There is no guarantee in biology for them to find an acyclic path in every case. Yet they have never failed to do so in their observations.

There are only six possible movements from a cell to an adjacent one, and they agree to write down those six by letters a, b, c, d, e, and f ounterclockwise as shown in Figure 2. Thus the layout in Figure 1 may be written down as "faafd".

Taro and Hanako have investigated beehives in a forest independently. Each has his/her own way to approach beehives, protecting oneself from possible bee attacks.

They are asked to report on their work jointly at a conference, and share their own observation records to draft a joint report. At this point they find a serious fault in their convention. They have never discussed which direction, in an absolute sense, should be taken as "a", and thus Figure 2 might be taken as, e.g., Figure 3 or Figure 4. The layout shown in Figure 1 may be recorded differently, depending on the direction looking at the beehive and the path assumed: "bcbdb" with combination of Figure 3 and Figure 5, or "bccac" with combination of Figure 4 and Figure 6.

A beehive can be observed only from its front side and never from its back, so a layout cannot be confused with its mirror image.

Since they may have observed the same layout independently, they have to find duplicated records in their observations (Of course, they do not record the exact place and the exact time of each observation). Your mission is to help Taro and Hanako by writing a program that checks whether two observation records are made from the same layout.

Input

The input starts with a line containing the number of record pairs that follow. The number is given with at most three digits.

Each record pair consists of two lines of layout records and a line containing a hyphen. Each layout record consists of a sequence of letters a, b, c, d, e, and f. Note that a layout record may be an empty sequence if a queen bee laid only one egg by some reason. You can trust Taro and Hanako in that any of the paths in the input does not force you to visit any cell more than once. Any of lines in the input contain no characters other than those described above, and contain at most one hundred characters.

Output

For each pair of records, produce a line containing either "true" or "false": "true" if the two records represent the same layout, and "false" otherwise. A line should not contain any other characters.

Sample Input

5
faafd
bcbdb
-
bcbdb
bccac
-
faafd
aafdd
-
aaafddd
aaaeff
-
aaedd
aafdd
-

Output for the Sample Input

true
true
false
false
false

Solution in C++ (judge verdict: Wrong Answer)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
 
int dx[] = {0, -1, -1, 0, 1, 1};
int dy[] = {-1, -1, 0, 1, 1, 0};

typedef pair<int, int> P; 

int main(){
  int n;
  cin >> n;
  string s1, s2;
  for(int i = 0 ; i < n ; i++){
    cin >> s1 >> s2;
    cin.ignore();
    cin.ignore();
 
    vector<int> m1, m2;
    for(int i = 0 ; i < (int)s1.size() ; i++) m1.push_back(s1[i]-'a');
    for(int i = 0 ; i < (int)s2.size() ; i++) m2.push_back(s2[i]-'a');
    
    vector<P> path1;
    int x1 = 0, y1 = 0;    
    int mx1 = (1<<29), my1 = (1<<29);
    path1.push_back(P(0, 0));
    for(int i = 0 ; i < (int)m1.size() ; i++){
      x1 += dx[ m1[i] ];
      y1 += dy[ m1[i] ];
      path1.push_back(P(x1, y1));
      mx1 = min(mx1, x1);
      my1 = min(my1, y1);      
    }
    for(int i = 0 ; i < path1.size() ; i++){
      path1[i].first -= mx1;
      path1[i].second -= my1;
    }
    sort(path1.begin(), path1.end());    
    
    bool flag = false;   
    for(int i = 0 ; i < 6 ; i++){
      int x2 = 0, y2 = 0;
      int mx2 = (1<<29), my2 = (1<<29);
      vector<P> path2;
      path2.push_back(P(0, 0));
      for(int j = 0 ; j < (int)m2.size() ; j++){
	x2 += dx[ (m2[j]+i)%6 ];
	y2 += dy[ (m2[j]+i)%6 ];
	path2.push_back(P(x2, y2));
	mx2 = min(mx2, x2);
	my2 = min(my2, y2);
      }
      for(int j = 0 ; j < path2.size() ; j++){
	path2[j].first -= mx2;
	path2[j].second -= my2;
      }
      sort(path2.begin(), path2.end());
      if(path1 == path2){
	flag = true;
	goto END;
      }
    }
  END:;
    if(flag) cout << "true" << endl;
    else cout << "false" << endl;
  }
  return 0;
}