#include<bits/stdc++.h>
#define int  long long
#define pii pair<int,int>
#define fir first
#define se second
#define ull unsigned long long
#define endl "\n"
using namespace std;
int n;
string t;
string s;
bool check(){
	if(s==t)return true;
	if(s.size()==t.size()){
		int cnt=0;
		for(int i = 0 ;i < s.size();i++){
			if(s[i] != t[i]) cnt++;
		}
		if(cnt <= 1) return true;
		else return false;
	}
	if(s.size() == t.size()-1){
//		cout<<'x';
		int cnt=0;
		int i,j;
		for(i = 0,j=0;i < s.size() && j < t.size();i++,j++){
//			cout<<i<<" "<<s[i]<<" "<<t[j]<<endl;
			while(s[i] != t[j] && j < s.size()){
				j++;
				cnt++;
			}
//			cout<<cnt<<endl;
		}
		if(cnt <= 1 && abs(i-j) <= 1)return true;
		return false;
	}
	if(s.size()-1==t.size()){
		int cnt=0;
		int i,j;
		for(i = 0,j=0;i < t.size() && j < s.size();i++,j++){
			while(t[i] != s[j] && j < t.size()){
				j++;
				cnt++;
			}
//			cout<<cnt<<endl;
		}
		if(cnt <= 1&& abs(i-j) <= 1)return true;
		return false;		
	}
	
	return false;
}
signed main(){
	cin >> n;
	cin >> t;
	queue<int> q;
	for(int i =1;i <= n;i++){
		cin >> s;
		if(check()) q.push(i);
	}
	cout<<q.size()<<endl;
	while(!q.empty()){
		cout<<q.front()<<" ";
		q.pop();
	}
	return 0;
}

```[记录](https://atcoder.jp/contests/abc324/submissions/46583556)