mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}

// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let t: u32 = sc.next();
    for _ in 0..t {
        let n: usize = sc.next();
        let m: usize = sc.next();
        let mut res = vec![0; m];
        let mut op = vec![];
        for _ in 0..n {
            let k: usize = sc.next();
            let mut p = vec![0usize; k];
            for (i, p) in p.iter_mut().enumerate() {
                *p = sc.next::<usize>() - 1;
                res[*p] = i + 1;
            }
            op.push(p);
        }
        let res = res;
        let mut cnt = vec![0; n];
        let mut list = vec![vec![]; m];
        let mut h = std::collections::BinaryHeap::new();
        for (x, (cnt, p)) in cnt.iter_mut().zip(op.iter()).enumerate() {
            for (i, &p) in p.iter().enumerate() {
                if res[p] != i + 1 {
                    *cnt += 1;
                    list[p].push(x);
                }
            }
            if *cnt == 0 {
                h.push(!x);
            }
        }
        let mut ans = vec![];
        while let Some(v) = h.pop() {
            let v = !v;
            ans.push(v + 1);
            for (i, &p) in op[v].iter().enumerate() {
                if i + 1 == res[p] {
                    for u in list[p].drain(..) {
                        cnt[u] -= 1;
                        if cnt[u] == 0 {
                            h.push(!u);
                        }
                    }
                }
            }
        }
        ans.reverse();
        if ans.windows(2).any(|a| a[0] > a[1]) {
            writeln!(out, "Yes").ok();
            use util::*;
            writeln!(out, "{}", ans.iter().join(" ")).ok();
        } else {
            writeln!(out, "No").ok();
        }
    }
}