#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <sstream>

#include <iostream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <ctime>

#define MAXN 103

using namespace std;

vector <string> mybad;

long long dp[MAXN][MAXN];

class AvoidRoads {

public:

long long numWays(int, int, vector <string>);

};

int *num(string s){

//cout<<s<<endl;

s+=' ';

int sz = s.size();

int *p = (int* )malloc(5*sizeof(int));

int cnt =0,sum=0;

for(int i=0; i<sz; i++){

if(s[i]==' '){

*(p+cnt) = sum;

cnt++;

sum=0;

}else{

sum = sum*10+s[i]-'0';

}

}

//*(p+cnt) = sum;

return p;

}

bool ok_down(int w, int h){

}

bool ok_left(int w, int h){

}

long long get_dp(int w, int h){

}

long long AvoidRoads::numWays(int width, int height, vector <string> bad) {

}

double test0() {

}

double test1() {

}

double test2() {

}

double test3() {

}

int main() {

}