#include<cstdio>
#include<cmath>
#define N 100005
#define M 320
#define K 10005
using namespace std;
int n,m,block,l[M],r[M],id[N],a[N],sum[M],h[M][K],x,y,z;char op[10];
int T[30]={4,7,44,47,74,77,444,447,474,744,477,747,774,777,
4444,4447,4474,4744,7444,4477,4747,4774,7447,7474,7744,4777,7477,7747,7774,7777};
int main(){
    freopen("cf121e.in","r",stdin);freopen("cf121e.out","w",stdout); 
    scanf("%d%d",&n,&m);block=sqrt(n)+1;
    for(int i=1;i<=n;i++)
        if(i%block==1)
            l[id[i]=id[i-1]+1]=i,r[id[i]]=r[id[i]-1]+block;
        else
            id[i]=id[i-1];
    for(int i=1;i<=n;i++)scanf("%d",a+i),h[id[i]][a[i]]++;
    while(m--)
    {
        scanf("%s%d%d",op,&x,&y);
        if(op[0]=='a')
        {
            scanf("%d",&z);
            while(x<=y&&x^l[id[x]])h[id[x]][a[x]]--,h[id[x]][a[x]+=z]++,x++;
            while(x<=y&&y^r[id[y]])h[id[y]][a[y]]--,h[id[y]][a[y]+=z]++,y--;
            while(x<y)sum[id[x]]+=z,x+=block;
        }
        else
        {
            int ans=0;
            while(x<=y&&x^l[id[x]])
            {
                for(int i=0;i<31;i++)
                    if(a[x]+sum[id[x]]==T[i])
                        ans++;
                x++;
            }
            while(x<=y&&y^r[id[y]])
            {
                for(int i=0;i<31;i++)
                    if(a[y]+sum[id[y]]==T[i])
                        ans++;
                y--;
            }
            while(x<y)
            {
                for(int i=0;i<31;i++)
                    if(sum[id[x]]<T[i])
                        ans+=h[id[x]][T[i]-sum[id[x]]];
                x+=block;
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}