import std;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); } bool DEBUG = 0; 
void log(A ...)(lazy A a){ if(DEBUG) print(a); }
void print(){ writeln(""); } void print(T)(T t){ writeln(t); } void print(T, A ...)(T t, A a){ std.stdio.write(t, " "), print(a); }
string unsplit(T)(T xs){ return xs.array.to!(string[]).join(" "); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; } T[] scan(T)(int n){ return n.iota.map!(i => scan!T()).array; }
T lowerTo(T)(ref T x, T y){ if(x > y) x = y; return x; } T raiseTo(T)(ref T x, T y){ if(x < y) x = y; return x; }

// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
  int n = scan!int;
  long p = scan!long;
  long[] as = scan.split("").to!(long[]);
  
  long ans;
  if(10 % p == 0){
    foreach(i, a; as) if(a % p == 0) ans += i + 1;
  }
  else{
    int[long] cnt = [0: 1];
    long x = 0;
    long m = 1;
    foreach_reverse(a; as){
      x += a * m, x %= p;
      m *= 10, m %= p;
      if(x !in cnt) cnt[x] = 0;
      ans += cnt[x];
      cnt[x] += 1;
    }
  }
  ans.writeln;
}