这道题怎么处理并解析---**描述 (Description):**
园区某部门举办了Family Day, 邀请员工及其家属参加; 将公司园区视为一个矩形, 起始园区设置在左上角, 终点园区设置在右下角; 家属参观园区时, 只能向右和向下园区前进; 求从起始园区到终点园区会有多少条不同的参观路径。
**输入描述 (Input Description):**
第一行为园区长和宽; 后面每一行表示该园区是否可以参观, 0表示可以参观, 1表示不能参观
1 <= 园区长, 园区宽 <= 100
**输出描述 (Output Description):**
输出为不同的路径数量
**用例输入 1 (Example Input 1):**
3 3
0 0 0
0 1 0
0 0 0
**用例输出 1 (Example Output 1):**
2
**Chart/Diagram Description:**
* **Type:** Grid/Table
* **Main Elements:**
* A 3x3 grid of cells.
* Each cell contains a single digit, either 0 or 1.
* The cell values are arranged as follows:
* Row 1: 0, 0, 0
* Row 2: 0, 1, 0
* Row 3: 0, 0, 0
* "Start" is labeled to the left of the top-left cell, with an arrow pointing into it.
* "End" is labeled to the right of the bottom-right cell, with an arrow pointing away from it.
* Two small arrows originate from the top-left cell (containing 0), one pointing right to the adjacent cell (containing 0), and one pointing down to the adjacent cell (containing 0).