#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={-1,0,1};
int X,Y;
int board[20][20];
int cnt;
void dfs(int y,int x){
	while(board[y][x]==2){
		y+=2;
	}
	if(y>=Y){
		cnt++;
		//printf("(y,x) =(%d,%d)\n",y,x);
		return;
	}
	
	//cout <<"y = "<<y <<" x = "<<x<<endl;
	for(int i =0; i<3;i++){
		int nx =x +dx[i];
		int ny =y +1;
		if(nx <1||nx>X)continue;
		if(i!=1&&board[ny][nx]==2)continue;
		if(board[ny][nx]==1)continue;
		if(board[ny][nx]==0||board[ny][nx]==2){
			dfs(ny,nx);
		}
	}
	return;
}

int main(){
	while(cin>>X>>Y,X||Y){
		cnt =0;
		rep(i,20)rep(j,20)board[i][j]=0;
		for(int i=1;i <=Y;i++){
			for(int j =1;j <=X;j++){
				cin>>board[i][j];
			}
		}
		for(int i =1;i <=X;i++){
			if(board[1][i]==0){
				dfs(1,i);
			}
			//cout <<endl;
		}
		cout <<cnt<<endl;
	}
	
}