/*
     Hell, 'til I reach Hell, I ain't scared
     Mama checkin' in my bedroom, I ain't there
                                                */
    #include<bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    using namespace std;

    #define Major  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define TxtIO   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    #define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
    #define write(a) for(auto x : a) cout<<x<<" ";
    #define int long long
    #define pb push_back
    #define all(a)  a.begin(),a.end()
    #define el "\n"

    typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

    const int inf=4e18;

    int dx[]={1,0,-1,0,1,1,-1,-1};
    int dy[]={0,1,0,-1,1,-1,1,-1};

    const int mod=1e9+7;
    const int MAX =1e6+7;

   // ---------------------------Function----------------------------------//
     vector<bool> is_prime(1e7+1, true);
    void TestCake(){
        vector<int>tmp;
        for(int i=1;i<=1e7;i++){
            if(is_prime[i]){
                tmp.pb(i);
            }
        }
        int l,r;cin>>l>>r;
        string s;
        cin>>s;
        int cnt=0;
        for(int i=l-1;i<r;i++){
            string here=to_string(tmp[i]);
            if(here.find(s)!=string::npos){
                cnt++;
            }
        }
        cout<<cnt;
    }
    //------------------------------Main---------------------------//
    signed main(){
        Major
        int T = 1;

            is_prime[0] = is_prime[1] = false;
            for (int i = 2; i * i <= 1e7; i++) {
                if (is_prime[i]) {
                    for (int j = i * i; j <= 1e7; j += i)
                        is_prime[j] = false;
                }
            }
//        cin >> T;
        while(T--){
            TestCake();
        //       cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
        }
        return 0;
    }