#include <bits/stdc++.h>
    using namespace std;

    typedef long long ll;
    typedef pair<int,int> ii;

    map<ii,bool> mapa;

    const ll mod = 1e9 + 7;
    ll dp[2005][1<<9 + 5];
    vector<bool> mark;
    vector<vector<int>> g;

    ll solve(int u,int n,int e){
    	ll ret = 0;
    	if(u >= n) return 1;

    	int mask = 0;

    	for(int i=u-e;i<=u+e;i++){
    		mask = (mask<<1);
    		if(i >= 0 && i < n && mark[i] == false){
    			mask = mask|(1);
    		}
    	}

    	if(dp[u][mask] != -1) return dp[u][mask];

    	for(auto v: g[u]){
    		if(mark[v] == false){
    			mark[v] = true;
    			ret += solve(u+1,n,e);
    			mark[v] = false;
    			ret %= mod;
    		}
    	}

    	dp[u][mask] = ret;

    	return ret;
    }

    int main(){

    	int n,e,k;

    	cin >> n >> e >> k;

    	mark.resize(n+1);
    	for(int i=0;i<k;i++){
    		int a,b;
    		cin >> a >> b;
    		a--;
    		b--;
    		mapa[{a,b}] = true;
    	}

    	for(int i=0;i<n;i++){
    		for(int j=0;j< (1<<9)+5;j++){
    			dp[i][j] = -1;
    		}
    	}
    	g.resize(n+1);
    	for(int i=0;i<n;i++){
    		for(int j=i-e;j<=i+e;j++){
    			if(j >= 0 && mapa.count({i,j}) == 0 && j < n){
    				g[i].push_back(j);
    				//printf("%d -> %d\n",i,j);
    			}
    		}
    	}

    	ll ans = solve(0,n,e);

    	cout << ans << endl;
    }