#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

struct mint{
    static constexpr int  m = 1000000009;
    int x;
    mint() : x(0){}
    mint(ll x_):x(x_%m){if(x<0) x+=m;}
    mint &operator+=(mint b){if((x+=b.x)>=m) x-=m; return *this;}
    mint &operator-=(mint b){if((x-=b.x)<0) x+=m; return *this;}
    mint &operator*=(mint b){x=(ll)(x)*b.x%m;return *this;}
    mint pow(ll e) const {
        mint r=1,b=*this;
        while(e){
            if(e&1) r*=b;
            b*=b;
            e>>=1;
        }
        return r;
    }
    mint inv(){return pow(m-2);}
    friend mint operator+(mint a,mint b){return a+=b;}
    friend mint operator*(mint a,mint b){return a*=b;}
    friend mint operator-(mint a,mint b){return a-=b;}
};

const int M=10;
int N;

mint f(string S){
    vector to(M,vector<int>(1<<(M-1)));
    rep(i,0,M) rep(j,0,1<<(M-1)){
        if(i==0){
            to[i][j]=j;
            continue;
        }
        to[i][j]=j+(1<<(i-1));
        for(int k=i;k>0;k--){
            if(j&(1<<(k-1))){
                to[i][j]-=(1<<(k-1));
                break;
            }
        }
    }
    vector<mint> dp(1<<(M-1));
    int val=0;
    for(auto c:S){
        vector<mint> n_dp(1<<(M-1));
        rep(i,0,1<<(M-1)) rep(j,0,M) n_dp[to[j][i]]+=dp[i];
        int a=c-'0';
        rep(i,0,a) n_dp[to[i][val]]+=1;
        swap(n_dp,dp);
        val=to[a][val];
    }
    mint res=0;
    rep(i,0,S[0]-'0'){
        res-=(mint(10)).pow(N-1)*(mint(i));
    }
    mint tmp=0;
    rep(i,1,N) tmp*=10,tmp+=(S[i]-'0');
    res-=tmp*(mint)(S[0]-'0');
    rep(i,0,(1<<(M-1))) res+=dp[i]*mint(popcount((unsigned int)(i)))*10;
    /*
    rep(i,0,(1<<(M-1))){
        if(dp[i].x!=0){
            cout<<i<<" "<<dp[i].x<<endl;
        }
    }
    cout<<res.x<<endl;*/
    return res;
}

mint g(string S){
    vector<int> p(M,0);
    for(auto c:S){
        int a=c-'0';
        rep(i,0,10) if(p[i]<=a){
            p[i]=a;
            break;
        }
    }
    mint res=0;
    rep(i,0,M) if(p[i]==0){
        res=i*10;
        break;
    }
    res-=S[0]-'0';
    return res;
}

void solve(){
    string L,R;
    cin>>N>>L>>R;
    cout<<(f(R)-f(L)+g(R)).x<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}