Give you a statement and table with its title in Markdown format, please determine whether the statement is supported or refuted by, or is unrelated to the table. It'a binary classification problem, you should choose the answer between supported and refuted. Table cells in one row are seperated by '|', and different rows are seperated by '
'.

Table:
| romaji title | japanese title | release date | reference | oricon |
| tenca wo torou! ~uchida no yabou~ | tencaを取ろう~内田の野望 | 1994 / 10 / 21 | kids - 220 | 1 |
| ashita wa ashita no kaze ga fuku | 明日は明日の風が吹く | 1995 / 04 / 05 | kids - 240 | 3 |
| only you | only you | 1995 / 04 / 21 | kids - 250 | 2 |
| baby 's growing up | baby 's growing up | 1995 / 08 / 19 | kids - 270 | 5 |
| shiawase ni naritai | 幸せになりたい | 1996 / 01 / 24 | kids - 280 | 6 |
| ever & ever (uchida yuki & mcat) | ever & ever | 1996 / 07 / 17 | kids - 300 | 8 |
| aishiteru | アイシテル | 1997 / 02 / 21 | kids - 330 | 23 |
| daisuki | daisuki | 1997 / 05 / 21 | kids - 340 | 29 |
| heartbreak sniper | ハートブレイク　スナイパー | 1998 / 09 / 23 | kids - 370 | 32 |
| rakuen | 楽園 | 1999 / 08 / 25 | kids - 430 | 28 |
Title:
none
Statement:
daisuki is a romaji title
Answer:
supported