import java.util.*;

public class AnagramSubsequenceFinder {
   
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
       
        String S = sc.nextLine();
       
        int N = sc.nextInt();
        sc.nextLine();
        String[] W = new String[N];
        for (int i = 0; i < N; i++) {
            W[i] = sc.nextLine();
        }
       
        int[] freqS = getFrequency(S);
       
        int count = 0;
        for (String w : W) {
            if (isValidAnagramSubsequence(freqS, w)) {
                count++;
            }
        }
       
        System.out.println(count);
    }
   
    private static int[] getFrequency(String S) {
        int[] freq = new int[26];
        for (char c : S.toCharArray()) {
            freq[c - 'a']++;
        }
        return freq;
    }

    private static boolean isValidAnagramSubsequence(int[] freqS, String w) {
        int[] freqW = new int[26];
        for (char c : w.toCharArray()) {
            freqW[c - 'a']++;
        }
       
        for (int i = 0; i < 26; i++) {
            if (freqW[i] > freqS[i]) {
                return false;
            }
        }
       
        return true;
    }
}


// Minimal substring length

Upstox is hiring for different roles.

SDE 1 (Backend), SDE 1 (iOS), SDE 2 (Frontend) and UI/UX Intern

Fill the form if eligible and interested: https://docs.google.com/forms/d/e/1FAIpQLSdd0jPiasglYGikjSOrlc1KkbcIYp3S5VAx005OifzBNS44ow/viewform

LI.GCD
Infosys ✅

def minimumSquads(parents):
    n = len(parents)
    depth = [-1] * n

    def calculate_depth(node):
        if depth[node] != -1:
            return depth[node]
        if parents[node] == -1:
            depth[node] = 0
        else:
            depth[node] = calculate_depth(parents[node]) + 1
        return depth[node]

    max_depth = 0
    for i in range(n):
        max_depth = max(max_depth, calculate_depth(i))

    return max_depth + 1

Minimum squads ✅

Company Name : Goldman Sachs
Role : Graduate Role (multiple roles)

Batch : 2026 passouts(non-engineering)

Link. : https://www.goldmansachs.com/careers/students/programs/india/graduate-campus-hiring-program.html

Last date to register is July 14.

Microsoft Hiring Software Engineer Intern

Batch : 2026

https://jobs.careers.microsoft.com/us/en/job/1735688/Software-Engineering-Intern

Company – IIDE Education Private Limited
Role – Data Analyst Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-analyst-internship-in-mumbai-at-iide-education-private-limited1720264879?utm_source=cp_link&referral=web_share

Company – Blackcoffer
Role – Data Science Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/work-from-home-data-science-internship-at-blackcoffer1720199867?utm_source=cp_link&referral=web_share

Company – AskmeOffers.com
Role – Data Analyst
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3965852124

Company – White Gold Bullion Private Limited
Role – Mis Executive
Exp. – 0-3 yrs
Apply Here – https://www.foundit.in/job/mis-executive-white-gold-bullion-private-limited-bengaluru-bangalore-31074671?searchId=b0b11ba6-607b-4d50-91c9-b823e3ce49dd

Company – Blockchain for the Next Billion
Role – Data Analyst
Exp. – 0-5 yrs
Apply Here – https://www.linkedin.com/jobs/view/3966385446

Cogntix is hiring for Full Stack Engineer Intern | Hybrid Opportunity | 2023/2024 passout | 50k per month


https://docs.google.com/forms/d/e/1FAIpQLSc9AWJrl_zbV9VtNIWJj_n6EafHrR1-is_OdNY8BjIcZuX4TQ/viewform?usp=sf_link

class Solution {
public:
  int minOperations(vector<int>& nums, int x, int y) {
    int l = 0;
    int r = ranges::max(nums);

    while (l < r) {
      const int m = (l + r) / 2;
      if (isPossible(nums, x, y, m))
        r = m;
      else
        l = m + 1;
    }

    return l;
  }

private:
  bool isPossible(const vector<int>& nums, int x, int y, int m) {
    long long additionalOps = 0;
    for (const int num : nums)
      additionalOps += max(0LL, (num - 1LL * y * m + x - y - 1) / (x - y));
    return additionalOps <= m;
  }
};

Citadel ✅

bool isposs(vector<int>thr,vector<int>cost,int m,int budget){
    int co=0;
    for(int i=0;i<thr.size();i++){
        if(thr[i]<m){
            if((m-thr[i])%thr[i]==0)co+=((m-thr[i])/thr[i])*cost[i];
           else
            co+=(((m-thr[i])/thr[i])+1)*cost[i];
           
        }
        if(co>budget)return 0;
    }
    return 1;
}
int getMaximumThroughput(vector<int> throughput, vector<int> scaling_cost, int budget) {
priority_queue<int>pq;
int l=0;
// for(auto it:throughput)l=max(l,it);
int r=1e9;
int ans=0;
cout<<isposs(throughput,scaling_cost,6,budget);
while(l<=r){
   int mid=(l+r)/2;
   if(isposs(throughput,scaling_cost,mid,budget)){
       l=mid+1;
       ans=mid;
   }
   else r=mid-1;
}
return ans;
}

Citadel ✅

Micron ✅