import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.util.Map.Entry;
import java.util.NoSuchElementException;
import static java.lang.Math.E;
import static java.lang.Math.PI;
import static java.lang.Math.abs;
import static java.lang.Math.acos;
import static java.lang.Math.asin;
import static java.lang.Math.atan2;
import static java.lang.Math.atan;
import static java.lang.Math.cos;
import static java.lang.Math.exp;
import static java.lang.Math.hypot;
import static java.lang.Math.log;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.sin;
import static java.lang.Math.sqrt;
import static java.lang.Math.tan;
import static java.lang.String.format;
import static java.lang.System.currentTimeMillis;
import static java.math.BigInteger.ONE;
import static java.math.BigInteger.TEN;
import static java.math.BigInteger.ZERO;
import static java.util.Arrays.fill;
import static java.util.Arrays.sort;
import static java.util.Collections.sort;
import static java.util.Comparator.reverseOrder;
import static java.util.Objects.isNull;
import static java.util.Objects.nonNull;

public class Main {
    public static void main(String[] args) {
        FastScanner fsc = new FastScanner();
        int n = fsc.nextInt();
        int p = fsc.nextInt();
        char[] s = fsc.next().toCharArray();
        if (p != 2 && p != 5) {
            int[][] tq = new int[10][p];
            for (int dg = 1; dg < 10; dg++) {
                tq[dg][0] = dg % p;
                for (int b = 1; b < p; b++) {
                    tq[dg][b] = (tq[dg][b - 1] * 10) % p;
                }
            }
            int[] q = new int[n + 1];
            for (int i = n - 1; i >= 0; i--) {
                int dg = s[i] - '0';
                q[i] = (tq[dg][(n - i - 1) % (p - 1)] + q[i + 1]) % p;
            }
            HashMap<Integer, Integer> mod = new HashMap<>();
            for (int i = 0; i <= n; i++) {
                if (!mod.containsKey(q[i])) {
                    mod.put(q[i], 1);
                } else {
                    mod.put(q[i], mod.get(q[i]) + 1);
                }
            }
            long ans = 0;
            for (Entry<Integer, Integer> e : mod.entrySet()) {
                long v = e.getValue();
                ans += (v * (v - 1)) / 2;
            }
            System.out.println(ans);
        } else if (p == 2) {
            long ans = 0;
            for (int i = 0; i < n; i++) {
                int tail = s[i] - '0';
                if (tail % 2 == 0) {
                    ans += i + 1;
                }
            }
            System.out.println(ans);
        } else {
            long ans = 0;
            for (int i = 0; i < n; i++) {
                int tail = s[i] - '0';
                if (tail % 5 == 0) {
                    ans += i + 1;
                }
            }
            System.out.println(ans);
        }
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte()) {
            return buffer[ptr++];
        } else {
            return -1;
        }
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++;
        }
        return hasNextByte();
    }

    public String next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
            throw new NumberFormatException();
        }
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}


Measured memory_bytes: 35376