本题编写程序模拟人进行连连看游戏，电脑模拟人玩连连看的过程如下：
1、分析本局游戏，将本局游戏转化成一个二位数组。0表示空白区域，数字表示该游戏牌为出现在游戏中的第几类游戏牌。
2、利用广度优先搜索算法，判断两个游戏牌是否可以消除。
3、程序模拟人点击可以消除的一对游戏牌进行消除。
对某局游戏转化成二维数组如下：
0 0 0 0 0
0 1 2 0 0
0 0 3 4 0
0 0 0 1 0
输入二位数组的行、列，二位数组、起始元素的的坐标、终止元素的坐标，判断起始游戏牌和终止游戏牌是否可以消除。
对上例输入
4 5
0 0 0 0 0　0 1 2 0 0　0 0 3 4 0　0 0 0 1 0
1 1
3 3
输出 TRUE(The writing program simulates the game, and the computer simulates the process of watching the game as follows:

1. Analyze the game and convert the game into a two - bit array. 0 is the blank area, the number indicates that the game card is the number of game cards that appear in the game.

2. Use the breadth first search algorithm to judge whether the two game cards can be eliminated.

3, the program simulates a pair of game cards that can be eliminated by clicking.

A game of a game is transformed into a two-dimensional array as follows:

00000

01200

00340

00010

Input the row and column of the two bit array, the coordinates of two bit array, the initial element, and the coordinates of the termination elements, so as to determine whether the initial game card and the ending game card can be eliminated.

For example input

45

0000001200 0034000010

11

33

Output TRUE)