#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int string_to_int(string s) {
  if (s == "") {
    return 0;
  }
  //debug(s);
  return stoi(s);
}

int main() {
  int n, p;
  scan(n, p);
  string s;
  scan(s);

  int d2 = 0;
  int d5 = 0;
  int d = 1;
  while (p % 2 == 0) {
    p /= 2;
    d2 += 1;
    d *= 2;
  }
  while (p % 5 == 0) {
    p /= 5;
    d5 += 1;
    d *= 5;
  }

  vll po10(n+1, 1);
  rep (i, n) {
    po10[i+1] = po10[i] * 10 % p;
  }
  vll suf(n+1, 0);
  for (int i = n-1; i >= 0; --i) {
    suf[n - i] = (suf[n - i - 1] + po10[n - i - 1] * (s[i] - '0')) % p;
  }
  //debug(suf);
  vvi idx(p);
  rep (i, n+1) {
    idx[suf[i]].push_back(i);
  }
  //debug(idx);
  ll ans = 0;
  rep (i, p) {
    int sz = idx[i].size();
    if (sz <= 1) { continue; }
    rep (j, sz) {
      int lb = lower_bound(idx[i].begin() + j + 1, idx[i].end(), idx[i][j] + max(d2, d5)) - idx[i].begin();
      if (n - idx[i][j] - max(d2, d5) >= 0 && string_to_int(s.substr(n - idx[i][j] - max(d2, d5), max(d2, d5))) % d == 0) {
        ans += (sz - lb);
      }
      FOR (k, j + 1, lb) {
        if (string_to_int(s.substr(n - idx[i][k], idx[i][k] - idx[i][j])) % d == 0) {
          ans += 1;
        }
      }
    }
  }
  print(ans);
  return 0;
}


Measured memory_bytes: 7296