#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
long xyz=1000000005;


int main(){
    int n,q;
    cin >> n >> q;
    string s;
    cin >> s;
    for(int i=0;i<q;i++){
        int x,y,z,ans=0;
        cin>>x;
        if(x==2)
            {
            cin>>y>>z;
            vector <int> al(26,0);
            for(int i=y;i<=z;i++)
                al[s[i]-'a']++;
            for(int i=0;i<26;i++)
                {
                //cout<<al[i];
                int t=al[i];
                //if(t>1){alg.push_back=al[i];}
                while(t){ans+=(t--);}
            }
            //cout<<ans;
            for(int i=0;i<26;i++)
                {
                for(int k=0;k<26;k++)
                    {
                    if(i==k){continue;}
                    if(al[i]>1)
                        {
                        //cout<<al[i];
                        int need=al[i]-1;
                        if(need<=al[k])
                            {
                            //cout<<al[k];
                            int use=0;
                            for(int p=0;p<need;p++)
                                use*=(al[k]-p);
                            ans+=use;
                        }
                    }
                }
            }
            cout<<ans%xyz<<"\n";
        }
        if(x==1)
            {
            int yz;
            cin>>y>>z>>yz;
        }
    }
    return 0;
}