Problem: Peter likes to travel by train. He likes it so much that on the train he falls asleep. 

Once in summer Peter was going by train from city A to city B, and as usual, was sleeping. Then he woke up, started to look through the window and noticed that every railway station has a flag of a particular colour.

The boy started to memorize the order of the flags' colours that he had seen. But soon he fell asleep again. Unfortunately, he didn't sleep long, he woke up and went on memorizing the colours. Then he fell asleep again, and that time he slept till the end of the journey.

At the station he told his parents about what he was doing, and wrote two sequences of the colours that he had seen before and after his sleep, respectively.

Peter's parents know that their son likes to fantasize. They give you the list of the flags' colours at the stations that the train passes sequentially on the way from A to B, and ask you to find out if Peter could see those sequences on the way from A to B, or from B to A. Remember, please, that Peter had two periods of wakefulness.

Peter's parents put lowercase Latin letters for colours. The same letter stands for the same colour, different letters — for different colours.

Input

The input data contains three lines. The first line contains a non-empty string, whose length does not exceed 105, the string consists of lowercase Latin letters — the flags' colours at the stations on the way from A to B. On the way from B to A the train passes the same stations, but in reverse order. 

The second line contains the sequence, written by Peter during the first period of wakefulness. The third line contains the sequence, written during the second period of wakefulness. Both sequences are non-empty, consist of lowercase Latin letters, and the length of each does not exceed 100 letters. Each of the sequences is written in chronological order. 

Output

Output one of the four words without inverted commas: 

  * «forward» — if Peter could see such sequences only on the way from A to B; 
  * «backward» — if Peter could see such sequences on the way from B to A; 
  * «both» — if Peter could see such sequences both on the way from A to B, and on the way from B to A; 
  * «fantasy» — if Peter could not see such sequences. 

Examples

Input

atob
a
b


Output

forward


Input

aaacaaa
aca
aa


Output

both

Note

It is assumed that the train moves all the time, so one flag cannot be seen twice. There are no flags at stations A and B.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
bool match(char text[], char pat1[], char pat2[]);
bool revmatch(char text[], char pat1[], char pat2[]);
int main() {
  int i, j;
  char text[100000], pattern1[102], pattern2[102];
  gets(text);
  gets(pattern1);
  gets(pattern2);
  bool forwardd = false, reversee = false;
  if (match(text, pattern1, pattern2) == true) forwardd = true;
  if (revmatch(text, pattern1, pattern2) == true) reversee = true;
  if (forwardd == true && reversee == false)
    cout << "forward\n";
  else if (forwardd == true && reversee == true)
    cout << "both\n";
  else if (forwardd == false && reversee == true)
    cout << "backward\n";
  else if (forwardd == false && reversee == false)
    cout << "fantasy\n";
  return 0;
}
bool match(char text[], char pat1[], char pat2[]) {
  int m = strlen(pat1), n = strlen(text), o = strlen(pat2);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m && i + j < n; j++) {
      if (text[i + j] != pat1[j]) break;
      if (j == m - 1) {
        i += m;
        for (; i < n; i++) {
          for (int j = 0; j < o && i + j < n; j++) {
            if (text[i + j] != pat2[j]) break;
            if (j == o - 1) return true;
          }
        }
      }
    }
  }
  return false;
}
bool revmatch(char text[], char pat1[], char pat2[]) {
  int m = strlen(pat1), n = strlen(text), o = strlen(pat2);
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j < m && (i - j) >= 0; j++) {
      if (text[i - j] != pat1[j]) break;
      if (j == m - 1) {
        i -= m;
        for (; i >= 0; i--) {
          for (int j = 0; j < o && (i - j) >= 0; j++) {
            if (text[i - j] != pat2[j]) break;
            if (j == o - 1) return true;
          }
        }
      }
    }
  }
  return false;
}