#include <bits/stdc++.h>

#define LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<LL>
#define VVL vector<vector<LL>>
#define VVVL vector<vector<vector<LL>>>
#define VB vector<bool>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14

template<class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> void print(T x) { std::cout << x << std::endl; }

const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = { 0, -1, 0, 1 }, dx = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）

using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while (true) {
        int X, Y;
        cin >> X >> Y;
        if (X == 0 and Y == 0) { break; }

        VVI field(Y, VI(X, 0));
        FOR(y, 0, Y) {
            FOR(x, 0, X) {
                int c;
                cin >> c;
                field[y][x] = c;
            }
        }

        VVI dp(Y, VI(X, 0));
        FOR(x, 0, X) {
            dp[0][x] = (field[0][x] == 0 ? 1 : 0);
        }

        FOR(y, 0, Y - 1) {
            FOR(x, 0, X) {
                // 移動可能なマス
                if (field[y][x] == 0) {
                    if (0 <= x - 1 and field[y + 1][x - 1] == 0) {
                        dp[y + 1][x - 1] += dp[y][x];
                    }
                    if (field[y + 1][x] != 1) {
                        dp[y + 1][x] += dp[y][x];
                    }
                    if (x + 1 < X and field[y + 1][x + 1] == 0) {
                        dp[y + 1][x + 1] += dp[y][x];
                    }
                // ジャンプ台
                } else if (field[y][x] == 2) {
                    if (y + 2 >= Y) {
                        dp[Y -1][x] += dp[y][x];
                    }
                    else if (y + 2 < Y and field[y + 2][x] != 1) {
                        dp[y + 2][x] += dp[y][x];
                    }
                }
            }
        }
        print(SUM(dp[Y - 1]));
    }

    return 0;
}
