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

// varibable settings
#define int long long
const int INF=1e18;

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

#define divceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define slice(l, r) substr(l, r-l)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
    #include "lib/dump.hpp"
#else
    #define dump(...) 42
    #define dump_1d(...) 42
    #define dump_2d(...) 42
    #define cerrendl 42
#endif
//}}}

int mod;
struct mint { //{{{
    int x;
    mint(int x=0):x((x%mod+mod)%mod){}

    // ?= operator
    mint& operator+=(const mint a) { (x += a.x) %= mod; return *this; }
    mint& operator-=(const mint a) { (x += mod-a.x) %= mod; return *this; }
    mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
    mint&operator/=(const mint&rhs){return *this*=rhs.inv();}

    mint operator+(const mint a) const { mint res(*this); return res+=a; }
    mint operator-(const mint a) const { mint res(*this); return res-=a; }
    mint operator*(const mint a) const { mint res(*this); return res*=a; }
    mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}

    mint pow(int n)const{
        mint res(1),x(*this);
        if (n<0){
            n = -n;
            x =(*this).inv();
        }
        while(n){
            if(n&1)res*=x;
            x*=x;
            n>>=1;
        }
        return res;
    }
    mint inv()const{return pow(mod-2);}
    /*mint inv()const{
      int x,y;
      int g=extgcd(v,mod,x,y);
      assert(g==1);
      if(x<0)x+=mod;
      return mint(x);
      }*/
    friend ostream& operator<<(ostream&os,const mint&m){
        return os<<m.x;
    }
    bool operator<(const mint&r)const{return x<r.x;}
    bool operator==(const mint&r)const{return x==r.x;}
};
//}}}

signed main() {
    int n,p;cin>>n>>p;
    string s;cin>>s;
    mod = p;

    if (p==2){
        int ans = 0;
        rep(i, n){
            int v = s[i]-'0';
            if (v%2==0) ans+=i+1;
        }
        cout << ans << endl;
        return 0;
    }
    if (p==5){
        int ans = 0;
        rep(i, n){
            int v = s[i]-'0';
            if (v==5 || v==0) ans+=i+1;
        }
        cout << ans << endl;
        return 0;
    }

    vector<int> a(n);
    vector<mint> x(n);
    x[0] = (s[0]-'0');
    rep(i, 1, n){
        x[i] = (x[i-1])*10 + (s[i]-'0');
    }
    dump(x);

    vector<mint> y(n);
    rep(i, n){
        y[i] = x[i] / mint(10).pow(i);
    }
    dump(y);

    vector<int> cnt(10001);
    cnt[0] = 1;

    int ans = 0;
    rep(r, n){
        int y_r = y[r].x;
        assert(0<=y_r && y_r<p);

        ans += cnt[y_r];
        dump(r, ans);
        cnt[y_r]++;
    }
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 5268