#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const array<T,26> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;

typedef array<int,26> AR;

const int N=(1<<17);

struct Seg{
  AR a;
  int s;
  Seg(){
    s=0; fill(all(a),0);
  }
  Seg(int v){
    s=0; fill(all(a),0);
    a[v]=1;
  }
  static Seg e;
};
Seg Seg::e=Seg();
//ostream& operator<<(ostream &os, const Seg &t) { return os<<"("<<t.h<<","<<t.q<<","<<t.r<<")";}
Seg seg[2*N+10];
Seg operator+(Seg l,const Seg &r){
  rep(i,26) l.a[i]+=r.a[i];
  return l;
}
inline void lazy_eval(int k,int a,int b){
  if(!seg[k].s)return;
  AR tmp=seg[k].a;
  rep(i,26) seg[k].a[(i+seg[k].s)%26]=tmp[i];
  //cout<<tmp<<"->"<<seg[k].a<<endl;
  if(2*k<=2*N+5){
    seg[2*k+1].s+=seg[k].s;
    seg[2*k+2].s+=seg[k].s;
  }
  seg[k].s=0;
}

inline void upd_node(int k){seg[k]=seg[2*k+1]+seg[2*k+2];} //todo?

void upd(int l,int r,int ope,Seg seg[]=seg,int k=0,int a=0,int b=N){
  //cout<<"update:"<<l<<","<<r<<","<<x<<","<<d<<","<<a<<","<<b<<endl;
  lazy_eval(k,a,b);
  if(b<=l || r<=a) return; 
  if(l<=a && b<=r){
    seg[k].s+=ope;
    lazy_eval(k,a,b);
    return;
  }	
  int m=(a+b)/2;
  upd(l,r,ope,seg,2*k+1,a,m);
  upd(l,r,ope,seg,2*k+2,m,b);
  upd_node(k);
}

Seg query(int l,int r,Seg seg[]=::seg,int k=0,int a=0,int b=N){
  lazy_eval(k,a,b);
  if(b<=l || r<=a)return Seg::e; 
  if(l<=a && b<=r){return seg[k];}
  
  int m=(a+b)/2;
  Seg vl=query(l,r,seg,2*k+1,a,m);
  Seg vr=query(l,r,seg,2*k+2,m,b);
  upd_node(k);
  //cout<<a<<","<<b<<":"<<vl<<","<<vr<<endl;
  return vl+vr;
}
ll modpow(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}
ll dp[112345][2];
int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  // dp[0][0]=1;
  // rep(i,102345){
  //   dp[i+1][0
  // }
  vector<ll> pw(112345);
  pw[0]=1;
  rep(i,102345) pw[i+1]=pw[i]*2%MOD;
  int n,q;
  cin>>n>>q;
  string str;
  cin>>str;
  rep(i,n) seg[i+N-1]=Seg(str[i]-'a');
  rrep(i,N-1) seg[i]=seg[i*2+1]+seg[i*2+2];
  while(q--){
    int T;
    cin>>T;
    if(T==1){
      int l,r,t;
      cin>>l>>r>>t; ++r; t%=26;
      upd(l,r,t);
    }else{
      int l,r;
      cin>>l>>r; ++r;
      AR a=query(l,r).a;
      ll re=1,p=1;
      for(int x:a)if(x){
	(re*=pw[x-1])%=MOD;
	++p;
      }
      cout<<(re*p%MOD+MOD-1)%MOD<<endl;
    }
  }
  // t mod 
  return 0;
}